Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND YEAR=1997
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
Piotr Berman
,
Andrzej Lingas
Theoretical Computer Science
174
(1-2), 1997, pp. 193-202
On topological dynamics of Turing machines
Petr Kůrka
Theoretical Computer Science
174
(1-2), 1997, pp. 203-216
Verifying identical communicating processes is undecidable
Alain Finkel
,
Pierre McKenzie
Theoretical Computer Science
174
(1-2), 1997, pp. 217-230
On an effective hierarchy of communicating processes: Separation principle and testing
John Mullins
Theoretical Computer Science
174
(1-2), 1997, pp. 231-246
The arithmetic of reversed positional games
Yõhei Yamasaki
Theoretical Computer Science
174
(1-2), 1997, pp. 247-249
Learning approximately regular languages with reversible languages
Satoshi Kobayashi
,
Takashi Yokomori
Theoretical Computer Science
174
(1-2), 1997, pp. 251-257
Various hierarchies of
\omega
-regular sets
Nobuyuki Takahashi
Theoretical Computer Science
174
(1-2), 1997, pp. 259-268
The undecidability of some equivalence problems concerning ngsm's and finite substitutions
P. Turakainen
Theoretical Computer Science
174
(1-2), 1997, pp. 269-274
The end of pumping?
Guo-Qiang Zhang
,
E. Rodney Canfield
Theoretical Computer Science
174
(1-2), 1997, pp. 275-279
Helios: A modeling language for global optimization and its implementation in Newton
Laurent Michel
,
Pascal van Hentenryck
Theoretical Computer Science
173
(1), 1997, pp. 3-48
Automatic generation of invariants and intermediate assertions
Nikolaj Bjorner
,
Anca Browne
,
Zohar Manna
Theoretical Computer Science
173
(1), 1997, pp. 49-87
From local to global consistency in temporal constraint networks
Manolis Koubarakis
Theoretical Computer Science
173
(1), 1997, pp. 89-112
Constrained dependencies
Michael J. Maher
Theoretical Computer Science
173
(1), 1997, pp. 113-149
Queries with arithmetical constraints
Stéphanie Grumbach
,
Jianwen Su
Theoretical Computer Science
173
(1), 1997, pp. 151-181
Avoiding slack variables in the solving of linear diophantine equations and inequations
Farid Ajili
,
Evelyne Contejean
Theoretical Computer Science
173
(1), 1997, pp. 183-208
A confluent calculus for concurrent constraint programming
Kim Marriott
,
Martin Odersky
Theoretical Computer Science
173
(1), 1997, pp. 209-233
Situated simplification
Andreas Podelski
,
Gert Smolka
Theoretical Computer Science
173
(1), 1997, pp. 235-252
Solving linear, min and max constraint systems using CLP based on relational interval arithmetic
Pierre Girodias
,
Eduard Cerny
,
William J. Older
Theoretical Computer Science
173
(1), 1997, pp. 253-281
Local and global relational consistency
Rina Dechter
,
Peter van Beek
Theoretical Computer Science
173
(1), 1997, pp. 283-308
May I borrow your logic? (Transporting logical structures along maps
Maura Cerioli
,
José Meseguer
Theoretical Computer Science
173
(2), 1997, pp. 311-347
Abstract data type systems
Jean-Pierre Jouannaud
,
Mitsuhiro Okada
Theoretical Computer Science
173
(2), 1997, pp. 349-391
Proof systems for structured specifications with observability operators
Rolf Hennicker
,
Martin Wirsing
,
Michel Bidoit
Theoretical Computer Science
173
(2), 1997, pp. 393-443
The definition of extended ML: A gentle introduction
Stefan Kahrs
,
Donald Sannella
,
Andrzej Tarlecki
Theoretical Computer Science
173
(2), 1997, pp. 445-484
Institutions for logic programming
Fernando Orejas
,
Elvira Pino
,
Hartmut Ehrig
Theoretical Computer Science
173
(2), 1997, pp. 485-511
Specification of abstract dynamic-data types: A temporal logic approach
Gerardo Costa
,
Gianna Reggio
Theoretical Computer Science
173
(2), 1997, pp. 513-554
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>