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=2001
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Decidability of the theory of the natural integers with the cantor pairing function and the successor
Patrick Cegielski
,
Denis Richard
Theoretical Computer Science
257
(1-2), 2001, pp. 51-77
On end extensions of models of subsystems of Peano arithmethic
C. Dimitracopoulos
Theoretical Computer Science
257
(1-2), 2001, pp. 79-84
Computer science and the fine structure of Borel sets
J. Duparc
,
O. Finkel
,
J.-P. Ressayre
Theoretical Computer Science
257
(1-2), 2001, pp. 85-105
Counting modulo finite semigroups
Henri-Alex Esbelin
Theoretical Computer Science
257
(1-2), 2001, pp. 107-114
A list of arithmetical structures complete with respect to the first-order definability
Ivan Korec
Theoretical Computer Science
257
(1-2), 2001, pp. 115-151
On quasi-unilateral universal Turing machines
Maurice Margenstern
Theoretical Computer Science
257
(1-2), 2001, pp. 153-166
Some arithmetical restatements of the Four Color Conjecture
Yuri Matiyasevich
Theoretical Computer Science
257
(1-2), 2001, pp. 167-183
Pushdown automata, multiset automata, and Petri nets
Yoram Hirsheld
,
Faron Moller
Theoretical Computer Science
256
(1-2), 2001, pp. 3-21
Nonprimitive recursive complexity and undecidability for Petri net equivalences
Petr Janc̑ar
Theoretical Computer Science
256
(1-2), 2001, pp. 23-30
Decidability of model checking with the temporal logic EF
Richard Mayr
Theoretical Computer Science
256
(1-2), 2001, pp. 31-62
Well-structured transition systems everywhere!
A. Finkel
,
Ph. Schnoebelen
Theoretical Computer Science
256
(1-2), 2001, pp. 63-92
Symbolic model checking with rich assertional languages
Y. Kesten
,
O. Maler
,
M. Marcus
,
A. Pnueli
,
E. Shahar
Theoretical Computer Science
256
(1-2), 2001, pp. 93-112
Automatic verification of parameterized networks of processes
David Lesens
,
Nicolas Halbwachs
,
Pascal Raymond
Theoretical Computer Science
256
(1-2), 2001, pp. 113-144
Ensuring completeness of symbolic verification methods for infinite-state systems
Parosh Aziz Abdulla
,
Bengt Jonsson
Theoretical Computer Science
256
(1-2), 2001, pp. 145-167
The complexity of path coloring and call scheduling
Thomas Erlebach
,
Klaus Jansen
Theoretical Computer Science
255
(1-2), 2001, pp. 33-50
Approximation algorithms for maximum two-dimensional pattern matching
Srinivasa R. Arikati
,
Anders Dessmark
,
Andrzej Lingas
,
Madhav V. Marathe
Theoretical Computer Science
255
(1-2), 2001, pp. 51-62
A relation-algebraic approach to the region connection calculus
Ivo Düntsch
,
Hui Wang
,
Steve McCloskey
Theoretical Computer Science
255
(1-2), 2001, pp. 63-83
Branch and bound on the network model
Sanjay Jain
Theoretical Computer Science
255
(1-2), 2001, pp. 107-123
Recursively enumberable reals and Chaitin
\Omega
numbers
Cristian S. Calude
,
Peter H. Hertling
,
Bakhadyr Khoussainov
,
Yongge Wang
Theoretical Computer Science
255
(1-2), 2001, pp. 125-149
On codes with a finite deciphering delay: Constructing uncompletable words
Jean Néraud
,
Carla Selmi
Theoretical Computer Science
255
(1-2), 2001, pp. 151-162
Marked PCP is decidable
Vesa Halava
,
Mika Hirvensalo
,
Ronald de Wolf
Theoretical Computer Science
255
(1-2), 2001, pp. 193-204
On pseudorandomness and resource-bounded measure
V. Arvind
,
Johannes Köbler
Theoretical Computer Science
255
(1-2), 2001, pp. 205-221
Locally finite languages
Olivier Finkel
Theoretical Computer Science
255
(1-2), 2001, pp. 223-261
Optimal three-dimensional layout of interconnection networks
Tiziana Calamoneri
,
Annalisa Massini
Theoretical Computer Science
255
(1-2), 2001, pp. 263-279
Fanout limitations on constraint systems
Tomás Feder
Theoretical Computer Science
255
(1-2), 2001, pp. 281-293
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>