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=170
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Confluence problems for trace rewriting systems
Markus Lohrey
Information and Computation
170
(1), 2001, pp. 1-25
Sparse sets and collapse of complexity classes
Vladimír Glasnák
Information and Computation
170
(1), 2001, pp. 26-48
Parallel beta reduction is not elementary recursive
Andrea Asperti
,
Harry G. Mairson
Information and Computation
170
(1), 2001, pp. 49-80
Improved fast integer sorting in linear space
Yijie Han
Information and Computation
170
(1), 2001, pp. 81-94
Vertical implementation
Arend Rensink
,
Roberto Gorrieri
Information and Computation
170
(1), 2001, pp. 95-133
Delayed information and action in on-line algorithms
Susanne Albers
,
Moses Charikar
,
Michael Mitzenmacher
Information and Computation
170
(2), 2001, pp. 135-152
Simplifying subtyping constraints: A theory
François Pottier
Information and Computation
170
(2), 2001, pp. 153-183
Probabilistic quorum systems
Dahlia Malkhi
,
Michael K. Reiter
,
Avishai Wool
,
Rebecca N. Wright
Information and Computation
170
(2), 2001, pp. 184-206
Functorial models for Petri nets
Roberto Bruni
,
José Meseguer
,
Ugo Montanari
,
Vladimiro Sassone
Information and Computation
170
(2), 2001, pp. 207-236