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=J. Comput.~Syst.~Sci. AND YEAR=2001
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fairness in routing and load balancing
Jon Kleinberg
,
Yuval Rabani
,
Éva Tardos
Journal of Computer and System Sciences
63
(1), 2001, pp. 2-20
Sharing the cost of multicast transmissions
Joan Feigenbaum
,
Christos H. Papadimitriou
,
Scott Shenker
Journal of Computer and System Sciences
63
(1), 2001, pp. 21-41
Recommendation systems: A probabilistic analysis
Ravi Kumar
,
Prabhakar Raghavan
,
Sridhar Rajagopalan
,
Andrew Tomkins
Journal of Computer and System Sciences
63
(1), 2001, pp. 42-61
Combining fairness with throughput: Online routing with multiple objectives
Ashish Goel
,
Adam Meyerson
,
Serge Plotkin
Journal of Computer and System Sciences
63
(1), 2001, pp. 62-79
The combinatorics of cache misses during matrix multiplication
Philip J. Hanlon
,
Dean Chung
,
Siddhartha Chatterjee
,
Daniela Genius
,
Arvin R. Lebeck
,
Erin Parker
Journal of Computer and System Sciences
63
(1), 2001, pp. 80-126
Compression using efficient multicasting
Micah Adler
,
Tom Leighton
Journal of Computer and System Sciences
63
(1), 2001, pp. 127-145
The communication complexity of enumeration, elimination, and selection
Andris Ambainis
,
Harry Buhrman
,
William Gasarch
,
Bala Kalyanasundaram
,
Leen Torenvliet
Journal of Computer and System Sciences
63
(2), 2001, pp. 148-185
On the complexity of some problems on groups input as multiplication tables
David Mix Barrington
,
Peter Kadau
,
Klaus-Jörn Lange
,
Pierre McKenzie
Journal of Computer and System Sciences
63
(2), 2001, pp. 186-200
Quantum Kolmogorov complexity
André Berthiaume
,
Win van Dam
,
Sophie Laplante
Journal of Computer and System Sciences
63
(2), 2001, pp. 201-221
Branching program size is almost linear in formula size
Oliver Giel
Journal of Computer and System Sciences
63
(2), 2001, pp. 222-235
Easiness assumptions and hardness tests: Trading time for zero error
Valentine Kabanets
Journal of Computer and System Sciences
63
(2), 2001, pp. 236-252
A lower bound for the shortest path problem
Ketan Mulmuley
,
Pradyut Shah
Journal of Computer and System Sciences
63
(2), 2001, pp. 253-267
Time-space tradeoffs for SAT on nonuniform machines
Iannis Tourlakis
Journal of Computer and System Sciences
63
(2), 2001, pp. 268-287
Integer circuit evaluation is PSPACE-complete
Ke Yang
Journal of Computer and System Sciences
63
(2), 2001, pp. 288-303
Language learning from texts: Degrees of intrinsic complexity and their characterizations
Sanjay Jain
,
Efim Kinber
,
Rolf Wiehagen
Journal of Computer and System Sciences
63
(3), 2001, pp. 305-354
Quantum neural networks
Sanjay Gupta
,
R.K.P. Zia
Journal of Computer and System Sciences
63
(3), 2001, pp. 355-383
Tight lower bounds on the size of sweeping automata
Hing Leung
Journal of Computer and System Sciences
63
(3), 2001, pp. 384-393
Logic over words on denumerable ordinals
Nicolas Bedon
Journal of Computer and System Sciences
63
(3), 2001, pp. 394-431
Distance realization problems with applications to Internet tomography
Fan Chung
,
Mark Garrett
,
Ronald Graham
,
David Shallcross
Journal of Computer and System Sciences
63
(3), 2001, pp. 432-448
Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity
Satyanarayana V. Lokam
Journal of Computer and System Sciences
63
(3), 2001, pp. 449-473
Low complexity variants of the arrow distributed directory
David Peleg
,
Eilon Reshef
Journal of Computer and System Sciences
63
(3), 2001, pp. 474-485
A polynomial-time algorithm for the bistable roommates problem
Jay Sehturaman
,
Chung-Piaw Teo
Journal of Computer and System Sciences
63
(3), 2001, pp. 486-497
A slight sharpening of LMN
Johan Håstad
Journal of Computer and System Sciences
63
(3), 2001, pp. 498-508
Which problems have strongly exponential complexity?
Russell Impagliazzo
,
Ramamohan Paturi
,
Francis Zane
Journal of Computer and System Sciences
63
(4), 2001, pp. 512-530
A randomized approximation scheme for metric MAX-CUT
W. Fernandez de la Vega
,
Claire Kenyon
Journal of Computer and System Sciences
63
(4), 2001, pp. 531-541
Seiten 1
2
3
>