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=171
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Contextual Petri nets, asymmetric event structures, and processes
Paolo Baldan
,
Andrea Corradini
,
Ugo Montanari
Information and Computation
171
(1), 2001, pp. 1-49
Induction by enumeration
Eric Martin
,
Daniel Osherson
Information and Computation
171
(1), 2001, pp. 50-68
The query complexity of finding local minima in the lattice
Amos Beimel
,
Felix Geller
,
Eyal Kushilevitz
Information and Computation
171
(1), 2001, pp. 69-83
Space bounds for resolution
Juan Luis Esteban
,
Jacobo Torán
Information and Computation
171
(1), 2001, pp. 84-97
Learning fixed-dimension linear thresholds from fragmented data
Paul W. Goldberg
Information and Computation
171
(1), 2001, pp. 98-122
Approximating unweighted connectivity problems in parallel
Zhi-Zhong Chen
Information and Computation
171
(2), 2001, pp. 125-136
A characterization of weakly Church-Rosser abstract reduction systems that are not Church-Rosser
Benedetto Intrigila
,
Ivano Salvo
,
Stefano Sorgi
Information and Computation
171
(2), 2001, pp. 137-155
Real-time properties of indirect recursive procedures
Johann Blieberger
Information and Computation
171
(2), 2001, pp. 156-182
Clausal logic and logic programming in algebraic domains
William C. Rounds
,
Guo-Qiang Zhang
Information and Computation
171
(2), 2001, pp. 183-200
Complexity theory and genetics: The computational power of crossing over
P. Pudlák
Information and Computation
171
(2), 2001, pp. 201-223
Optimal robot localization in trees
Rudolf Fleischer
,
Kathleen Romanik
,
Sven Schuierer
,
Gerhard Trippen
Information and Computation
171
(2), 2001, pp. 224-247
Distributed probabilistic polling and applications to proportionate agreement
Yehuda Hassin
,
David Peleg
Information and Computation
171
(2), 2001, pp. 248-268
Rationality in algebras with a series operation
K. Lodaya
,
P. Weil
Information and Computation
171
(2), 2001, pp. 269-293
Online variable sized covering
Leah Epstein
Information and Computation
171
(2), 2001, pp. 294-305
An infinite hierarchy of temporal logics over branching time
Alexander Rabinovich
,
Shahar Maoz
Information and Computation
171
(2), 2001, pp. 306-332
Lower bounds for dynamic algebraic problems
Gudmund Skovbjerg Frandsen
,
Johan P. Hansen
,
Peter Bro Miltersen
Information and Computation
171
(2), 2001, pp. 333-349
Guaranteeing the diversity of number generators
Adi Shamir
,
Boaz Tsaban
Information and Computation
171
(2), 2001, pp. 350-363
Efficient and flexible matching of recursive types
Jens Palsberg
,
Tian Zhao
Information and Computation
171
(2), 2001, pp. 364-387