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
[1]
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND YEAR=2001
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the expressive power of first-order Boolean function in PCF
Riccardo Pucella
,
Prakash Panangaden
Theoretical Computer Science
266
(1-2), 2001, pp. 543-567
Bisimulations in the join-calculus
Cédric Fournet
,
Cosimo Laneve
Theoretical Computer Science
266
(1-2), 2001, pp. 569-603
The parallel composition of uniform processes with data
Jan Friso Groote
,
Jos van Wamel
Theoretical Computer Science
266
(1-2), 2001, pp. 631-652
Self-stabilizing
l
-exlusion
Uri Abraham
,
Shlomi Dolev
,
Ted Herman
,
Irit Koll
Theoretical Computer Science
266
(1-2), 2001, pp. 653-692
Distributed processes and location failures
James Riely
,
Matthew Hennessy
Theoretical Computer Science
266
(1-2), 2001, pp. 693-735
On the longest perpetual reductions in orthogonal expression reduction systems
Zurab Khasidashvili
Theoretical Computer Science
266
(1-2), 2001, pp. 737-772
An induction principle for pure type systems
Gilles Barthe
,
John Hatcliff
,
Morten Heine B. Srenson
Theoretical Computer Science
266
(1-2), 2001, pp. 773-818
What is the coalgebraic analogue of Birkhoff's variety theorem?
Robert Goldblatt
Theoretical Computer Science
266
(1-2), 2001, pp. 853-886
Sparse and limited wavelength conversion in all-optical tree networks
Vincenzo Auletta
,
Ioannis Caragiannis
,
Luisa Gargano
,
Christos Kaklamanis
,
Pino Persiano
Theoretical Computer Science
266
(1-2), 2001, pp. 887-934
Underspecification for a simple process algebra of recursive processes
M.E. Majster-Cederbaum
Theoretical Computer Science
266
(1-2), 2001, pp. 935-950
Constant time parallel computations in
\lambda
-calculus
Thierry Joly
Theoretical Computer Science
266
(1-2), 2001, pp. 975-985
Encoding Hamiltonian circuits into multiplicative linear logic
Thomas Krantz
,
Virgile Mogbil
Theoretical Computer Science
266
(1-2), 2001, pp. 987-996
Statistical mechanics methods and phase transitions in optimization problems
Olivier C. Martin
,
Rémi Monasson
,
Riccardo Zecchina
Theoretical Computer Science
265
(1-2), 2001, pp. 3-67
A physicist's approach to number partitioning
Stephan Mertens
Theoretical Computer Science
265
(1-2), 2001, pp. 79-108
Rigorous results for random
(2+p)
-SAT
Dimitris Achlioptas
,
Lefteris M. Kirousis
,
Evangelos Kranakis
,
Danny Krizanc
Theoretical Computer Science
265
(1-2), 2001, pp. 109-129
Random 2-SAT: Results and problems
W. Fernandez de la Vega
Theoretical Computer Science
265
(1-2), 2001, pp. 131-146
Results related to threshold phenomena research in satisfiability: Lower bounds
John Franco
Theoretical Computer Science
265
(1-2), 2001, pp. 147-157
Lower bounds for random 3-SAT via differential equations
Dimitris Achlioptas
Theoretical Computer Science
265
(1-2), 2001, pp. 159-185
Upper bounds on the satisfiability threshold
Olivier Dubois
Theoretical Computer Science
265
(1-2), 2001, pp. 187-197
Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs
Alexander K. Hartmann
,
Martin Weigt
Theoretical Computer Science
265
(1-2), 2001, pp. 199-225
Frozen development in graph coloring
Joseph Culberson
,
Ian Gent
Theoretical Computer Science
265
(1-2), 2001, pp. 227-264
Complexity of learning in artificial neural networks
Andreas Engel
Theoretical Computer Science
265
(1-2), 2001, pp. 285-306
Multiple splicing sytems and the universal computability
Satoshi Kobayashi
,
Yasubumi Sakakibara
Theoretical Computer Science
264
(1), 2001, pp. 3-23
Logical string rewriting
Vincenzo Manca
Theoretical Computer Science
264
(1), 2001, pp. 25-51
Gossiping in chordal rings under the line model
Lali Barrière
,
Johanne Cohen
,
Margarida Mitjana
Theoretical Computer Science
264
(1), 2001, pp. 53-64
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>