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=173
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Finding recursions for multidimensional arrays
Oliver Pretzel
Information and Computation
173
(1), 2002, pp. 1-14
Decidability of split equivalence
Y. Abramson
,
A. Rabinovich
Information and Computation
173
(1), 2002, pp. 15-39
Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems
Harry B. Hunt III
,
Madhav V. Marathe
,
Venkatesh Radhakrishnan
,
S.S. Ravi
,
Daniel J. Rosenkrantz
,
Richard E. Stearns
Information and Computation
173
(1), 2002, pp. 40-63
Fair simulation
Thomas A. Henzinger
,
Orna Kupferman
,
Sriram K. Rajamani
Information and Computation
173
(1), 2002, pp. 64-81
Resource access control in systems of mobile agents
Matthew Hennessy
,
James Riely
Information and Computation
173
(1), 2002, pp. 82-120
Optimal series-parallel trade-offs for reducing a function to its own graph
Richard Beigel
,
Lane A. Hemaspaandra
,
Harald Hempel
,
Jörg Vogel
Information and Computation
173
(2), 2002, pp. 123-131
Optimal deterministic protocols for mobile robots on a grid
Roberto Grossi
,
Andrea Pietracaprina
,
Geppino Pucci
Information and Computation
173
(2), 2002, pp. 132-142
On the complexity of verifying concurrent transition systems
David Harel
,
Orna Kupferman
,
Moshe Y. Vardi
Information and Computation
173
(2), 2002, pp. 143-161
Computing in totally anonymous asynchronous shared memory systems
Hagit Attiya
,
Alla Gorbach
,
Shlomo Moran
Information and Computation
173
(2), 2002, pp. 162-183
Simulation preorder over simple process algebras
Antonín Kuc̑era
,
Richard Mayr
Information and Computation
173
(2), 2002, pp. 184-198
Syntactic type soundness results for the region calculus
Cristiano Calcagno
,
Simon Helsen
,
Peter Thiemann
Information and Computation
173
(2), 2002, pp. 199-221
Unavoidable sets of words of uniform length
C.J. Saker
,
P.M. Higgins
Information and Computation
173
(2), 2002, pp. 222-226