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=SIAM J. Comput. AND Volume=37
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the computational complexity of the forcing chromatic number
Frank Harary
,
Wolfgang Slany
,
Oleg Verbitsky
SIAM Journal on Computing
37
(1), 2007, pp. 1-19
Lower bounds for quantum communication complexity
Hartmut Klauck
SIAM Journal on Computing
37
(1), 2007, pp. 20-46
Adiabatic quantum state generation
Dorit Aharonov
,
Amnon Ta-Shma
SIAM Journal on Computing
37
(1), 2007, pp. 47-82
A probabilistic study on combinatorial expanders and hashing
Phillip G. Bradford
,
Michael N. Katehakis
SIAM Journal on Computing
37
(1), 2007, pp. 83-111
Hardness of the undirected congestion minimization problem
Matthew Andrews
,
Lisa Zhang
SIAM Journal on Computing
37
(1), 2007, pp. 112-131
Constraint satisfaction, logic and forbidden patterns
Florent Madelaine
,
Iain A. Stewart
SIAM Journal on Computing
37
(1), 2007, pp. 132-163
Adiabatic quantum computation is equivalent to standard quantum computation
Dorit Aharonov
,
Wim van Dam
,
Julia Kempe
,
Zeph Landau
,
Seth Lloyd
,
Oded Regev
SIAM Journal on Computing
37
(1), 2007, pp. 166-194
On the list and bounded distance decodability of Reed-Solomon codes
Qi Cheng
,
Daqing Wan
SIAM Journal on Computing
37
(1), 2007, pp. 195-209
Quantum walk algorithm for element distinctness
Andris Ambainis
SIAM Journal on Computing
37
(1), 2007, pp. 210-239
Dynamic optimality - Almost
Erik D. Demaine
,
Dion Harmon
,
John Iacono
,
Mihai Pȃtraşcu
SIAM Journal on Computing
37
(1), 2007, pp. 240-251
Algebras with polynomial identities and computing the determinant
Steve Chien
,
Alistair Sinclair
SIAM Journal on Computing
37
(1), 2007, pp. 252-266
Worst-case to average-case reductions based on Gaussian measures
Daniele Micciancio
,
Oded Regev
SIAM Journal on Computing
37
(1), 2007, pp. 267-302
A polynomial time algorithm for computing an Arrow-Debreu market equilibrium for linear utilities
Kamal Jain
SIAM Journal on Computing
37
(1), 2007, pp. 303-318
Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?
Subhash Khot
,
Guy Kindler
,
Elchanan Mossel
,
Ryan O'Donnell
SIAM Journal on Computing
37
(1), 2007, pp. 319-357
Range-efficient counting of distinct elements in a massive data stream
A. Pavan
,
Srikanta Tirthapura
SIAM Journal on Computing
37
(2), 2007, pp. 359-379
Derandomization in cryptography
Boaz Barak
,
Shien Jin Ong
,
Salil Vadhan
SIAM Journal on Computing
37
(2), 2007, pp. 380-400
A
\frac32
-approximation algorithm for scheduling independent monotonic malleable tasks
Gregory Mounie
,
Christophe Rapine
,
Denis Trystram
SIAM Journal on Computing
37
(2), 2007, pp. 401-412
Quantum algorithms for the triangle problem
Frédéric Magniez
,
Miklos Santha
,
Mario Szegedy
SIAM Journal on Computing
37
(2), 2007, pp. 413-424
Membership problem for the modular group
Yuri Gurevich
,
Paul Schupp
SIAM Journal on Computing
37
(2), 2007, pp. 425-459
Approximation algorithms for constrained node weighted Steiner tree problems
A. Moss
,
Y. Rabani
SIAM Journal on Computing
37
(2), 2007, pp. 460-481
Testing versus estimation of graph properties
Eldar Fischer
,
Ilan Newman
SIAM Journal on Computing
37
(2), 2007, pp. 482-501
Definability of languages by generalized first-order formulas over (N,
+
)
Amitabha Roy
,
Howard Straubing
SIAM Journal on Computing
37
(2), 2007, pp. 502-521
Lines and free line segments tangent to arbitrary three-dimensional convex polyhedra
Hervé Brönnimann
,
Olivier Devillers
,
Vida Dujmović
,
Hazel Everett
,
Marc Glisse
,
Xavier Goaoc
,
Sylvain Lazard
,
Hyeon-Suk Na
,
Sue Whitesides
SIAM Journal on Computing
37
(2), 2007, pp. 522-551
One-way communication complexity and the Nec̑iporuk lower bound on formula size
Hartmut Klauck
SIAM Journal on Computing
37
(2), 2007, pp. 552-583
Optimal expected-case planar point location
Sunil Arya
,
Theocharis Malamatos
,
David M. Mount
,
Ka Chun Wong
SIAM Journal on Computing
37
(2), 2007, pp. 584-610
Seiten 1
2
3
4
>