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=2004
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Resolution lower bounds for perfect matching principles
Alexander A. Razborov
Journal of Computer and System Sciences
69
(1), 2004, pp. 3-27
The correlation between parity and quadratic polynomials mod 3
Frederic Green
Journal of Computer and System Sciences
69
(1), 2004, pp. 28-44
The inapproximability of lattice and coding problems with preprocessing
Uriel Feige
,
Daniele Micciancio
Journal of Computer and System Sciences
69
(1), 2004, pp. 45-67
Hardness amplification within
NP
Ryan O'Donnell
Journal of Computer and System Sciences
69
(1), 2004, pp. 68-94
Scaled dimension and nonuniform complexity
John M. Hitchcock
,
Jack H. Lutz
,
Elvira Mayordomo
Journal of Computer and System Sciences
69
(2), 2004, pp. 97-122
Robust learning - Rich and poor
John Case
,
Sanjay Jain
,
Frank Stephan
,
Rolf Wiehagen
Journal of Computer and System Sciences
69
(2), 2004, pp. 123-165
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Erik D. Demaine
,
MohammadTaghi Hajiaghayi
,
Naomi Nishimura
,
Prabhakar Ragde
,
Dimitrios M. Thilikos
Journal of Computer and System Sciences
69
(2), 2004, pp. 166-195
On approximating weighted sums with exponentially many terms
Deepak Chawla
,
Lin Li
,
Stephen Scott
Journal of Computer and System Sciences
69
(2), 2004, pp. 196-234
Minimal DFA for testing divisibility
Boris Alexeev
Journal of Computer and System Sciences
69
(2), 2004, pp. 235-243
A lower bound on the quantum query complexity of read-once functions
Howard Barnum
,
Michael Saks
Journal of Computer and System Sciences
69
(2), 2004, pp. 244-258
On relations between counting communication complexity classes
Carsten Damm
,
Matthias Krause
,
Christoph Meinel
,
Stephan Waack
Journal of Computer and System Sciences
69
(2), 2004, pp. 259-280
Network QoS games: Stability vs optimality tradeoff
Andrew Lomonosov
,
Meera Sitharam
,
Kihong Park
Journal of Computer and System Sciences
69
(2), 2004, pp. 281-302
Random knapsack in expected polynomial time
^{*1}
Rene Beier
,
Berthold Vöcking
Journal of Computer and System Sciences
69
(3), 2004, pp. 306-329
Integer priority queues with decrease key in constant time and the single source shortest paths problem
Mikkel Thorup
Journal of Computer and System Sciences
69
(3), 2004, pp. 330-353
Testing subgraphs in directed graphs
Noga Alon
,
Asaf Shapira
Journal of Computer and System Sciences
69
(3), 2004, pp. 354-382
Optimal oblivious routing in polynomial time
Yossi Azar
,
Edith Cohen
,
Amos Fiat
,
Haim Kaplan
,
Harald Räcke
Journal of Computer and System Sciences
69
(3), 2004, pp. 383-394
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Iordanis Kerenidis
,
Ronald de Wolf
Journal of Computer and System Sciences
69
(3), 2004, pp. 395-420
Learning functions of
k
relevant variables
Elchanan Mossel
,
Ryan O'Donnell
,
Rocco A. Servedio
Journal of Computer and System Sciences
69
(3), 2004, pp. 421-434
Cell-probe lower bounds for the partial match problem
T.S. Jayram
,
Subhash Khot
,
Ravi Kumar
,
Yuval Rabani
Journal of Computer and System Sciences
69
(3), 2004, pp. 435-447
Classical complexity and quantum entanglement
Leonid Gurvits
Journal of Computer and System Sciences
69
(3), 2004, pp. 448-484
A tight bound on approximating arbitrary metrics by tree metrics
Jittat Fakcharoenphol
,
Satish Rao
,
Kunal Talwar
Journal of Computer and System Sciences
69
(4), 2004, pp. 485-497
On the reducibility of sets inside
NP
to sets with low information content
Mitsunori Ogihara
,
Till Tantau
Journal of Computer and System Sciences
69
(4), 2004, pp. 499-524
Linear time algorithms for finding and representing all the tandem repeats in a string
Dan Gusfield
,
Jens Stoye
Journal of Computer and System Sciences
69
(4), 2004, pp. 525-546
Approximating the dense set-cover problem
Reuven Bar-Yehuda
,
Zehavit Kehat
Journal of Computer and System Sciences
69
(4), 2004, pp. 547-561
One-dimensional quantum walks with absorbing boundaries
Eric Bach
,
Susan Coppersmith
,
Marcel Paz Goldschen
,
Robert Joynt
,
John Watrous
Journal of Computer and System Sciences
69
(4), 2004, pp. 562-592
Seiten 1
2
3
>