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 Volume=243
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Processes of timed Petri nets
Józef Winkowski
Theoretical Computer Science
243
(1-2), 2000, pp. 1-34
Revisiting the PAXOS algorithm
Roberto de Prisco
,
Butler Lampson
,
Nancy Lynch
Theoretical Computer Science
243
(1-2), 2000, pp. 35-91
Swinging types = functions + relations + transition systems
Peter Padawitz
Theoretical Computer Science
243
(1-2), 2000, pp. 93-165
Decidability and complexity of simultaneous rigid
E
-unification with one variable and related results
Anatoli Degtyarev
,
Yuri Gurevich
,
Paliath Narendran
,
Margus Veanes
,
Andrei Voronkov
Theoretical Computer Science
243
(1-2), 2000, pp. 167-184
Tractability of cut-free Gentzen-type propositional calculus with permutation inference II
Noriko H. Arai
Theoretical Computer Science
243
(1-2), 2000, pp. 185-197
A Gentzen-style sequent calculus of constructions with expansion rules
Jonathan P. Seldin
Theoretical Computer Science
243
(1-2), 2000, pp. 199-215
Simple end efficient network decomposition and synchronization
Shlomo Moran
,
Sagi Snir
Theoretical Computer Science
243
(1-2), 2000, pp. 217-241
Planar quorums
Rida A. Bazzi
Theoretical Computer Science
243
(1-2), 2000, pp. 243-268
Alarm placement in systems with fault propagation
K.B. Lakshmanan
,
Daniel J. Rosenkrantz
,
S.S. Ravi
Theoretical Computer Science
243
(1-2), 2000, pp. 269-288
Power consumption in packet radio networks
Lefteris M. Kirousis
,
Evangelos Kranakis
,
Danny Krizanc
,
Andrzej Pelc
Theoretical Computer Science
243
(1-2), 2000, pp. 289-305
Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability
Yuh-Jzer Joung
Theoretical Computer Science
243
(1-2), 2000, pp. 307-338
Composing leads-to properties
David Meier
,
Beverly Sanders
Theoretical Computer Science
243
(1-2), 2000, pp. 339-361
Secure distributed storage and retrieval
Juan A. Garay
,
Rosario Gennaro
,
Charanjit Jutla
,
Tal Rabin
Theoretical Computer Science
243
(1-2), 2000, pp. 363-389
Language preorder as a precongruence
Wan Fokkink
Theoretical Computer Science
243
(1-2), 2000, pp. 391-408
A causal semantics for time Petri nets
Tuomas Aura
,
Johan Lilius
Theoretical Computer Science
243
(1-2), 2000, pp. 409-447
Grzegorczyk's hierarchy of computable analysis
Qing Zhou
Theoretical Computer Science
243
(1-2), 2000, pp. 449-466
Symbolic model checking for
\mu
-calculus requires exponential time
A. Rabinovich
Theoretical Computer Science
243
(1-2), 2000, pp. 467-475
The proof complexity of analytic and clausal tableaux
Fabio Massacci
Theoretical Computer Science
243
(1-2), 2000, pp. 477-487
On normalizing, non-terminating one-rule string rewriting systems
Alfons Geser
Theoretical Computer Science
243
(1-2), 2000, pp. 489-498