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=Inf.~Comput. AND Volume=158
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Decidability of bisimilarity for one-counter processes
Petr Janc̑ar
Information and Computation
158
(1), 2000, pp. 1-17
Parallel preprocessing for path queries without concurrent reading
Torben Hagerup
Information and Computation
158
(1), 2000, pp. 18-28
Tally
NP
sets and easy census functions
Judy Goldsmith
,
Mitsunori Ogihara
,
Jörg Rothe
Information and Computation
158
(1), 2000, pp. 29-52
A randomized algorithm for two servers on the line
Yair Bartal
,
Marek Chrobak
,
Lawrence L. Larmore
Information and Computation
158
(1), 2000, pp. 53-69
Communication protocols for secure distributed computation of binary functions
Eytan Modiano
,
Anthony Ephremides
Information and Computation
158
(2), 2000, pp. 71-97
Optimal algorithms for the coverability, the subword, the containment, and the equivalence problems for commutative semigroups
Ulla Koppenhagen
,
Ernst W. Mayr
Information and Computation
158
(2), 2000, pp. 98-124
A short note on some tractable cases of the satisfiability problem
Hans van Maaren
Information and Computation
158
(2), 2000, pp. 125-130