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
[1]
Hilfe
Suche: Journal=J. Comput.~Syst.~Sci. AND Volume=63
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Time-space tradeoffs for branching programs
Paul Beame
,
T.S. Jayram
,
Michael Saks
Journal of Computer and System Sciences
63
(4), 2001, pp. 542-572
Protocols for asymmetric communication channels
Micah Adler
,
Bruce M. Maggs
Journal of Computer and System Sciences
63
(4), 2001, pp. 573-596
The minimum equivalent DNF problem and shortest implicants
Christopher Umans
Journal of Computer and System Sciences
63
(4), 2001, pp. 597-611
Perfect information leader election in
\log^* n+O(1)
rounds
Alexander Russell
,
David Zuckerman
Journal of Computer and System Sciences
63
(4), 2001, pp. 612-626
On approximate nearest neighbors under
|_\infty
norm
Piotr Indyk
Journal of Computer and System Sciences
63
(4), 2001, pp. 627-638
Heuristics for semirandom graph problems
Uriel Feige
,
Joe Kilian
Journal of Computer and System Sciences
63
(4), 2001, pp. 639-671
Randomness vs time: Derandomization under a uniform assumption
Russell Impagliazzo
,
Avi Wigderson
Journal of Computer and System Sciences
63
(4), 2001, pp. 672-688
Seiten
<
1
2