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=SIAM J. Comput. AND Volume=39
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximate halfspace range counting
Boris Aronov
,
Micha Sharir
SIAM Journal on Computing
39
(7), 2010, pp. 2704-2725
An
O(1)
RMRs leader election algorithm
Wojciech Golab
,
Danny Hendler
,
Philipp Woelfel
SIAM Journal on Computing
39
(7), 2010, pp. 2726-2760
On the implementation of huge random objects
Oded Goldreich
,
Shafi Goldwasser
,
Asaf Nussboim
SIAM Journal on Computing
39
(7), 2010, pp. 2761-2822
A better algorithm for random
k
-SAT
Amin Coja-Oghlan
SIAM Journal on Computing
39
(7), 2010, pp. 2823-2864
Faster algorithms for all-pairs approximate shortest paths in undirected graphs
Surender Baswana
,
Telikepalli Kavitha
SIAM Journal on Computing
39
(7), 2010, pp. 2865-2896
Local monotonicity reconstruction
Michael Saks
,
C. Seshadhri
SIAM Journal on Computing
39
(7), 2010, pp. 2897-2926
An efficient algorithm for partial order production
Jean Cardinal
,
Samuel Fiorini
,
Gwenaël Joret
,
Raphaël M. Jungers
,
J. Ian Munro
SIAM Journal on Computing
39
(7), 2010, pp. 2927-2940
Quantum hardcore functions by complexity-theoretical quantum list decoding
Akinori Kawachi
,
Tomoyuki Yamakami
SIAM Journal on Computing
39
(7), 2010, pp. 2941-2969
An approximation algorithm for max-min fair allocation of indivisible goods
Arash Asadpour
,
Amin Saberi
SIAM Journal on Computing
39
(7), 2010, pp. 2970-2989
Preprocessing imprecise points and splitting triangulations
Marc van Kreveld
,
Maarten Löffler
,
Joseph S.B. Mitchell
SIAM Journal on Computing
39
(7), 2010, pp. 2990-3000
Approximating Steiner networks with node-weights
Zeev Nutov
SIAM Journal on Computing
39
(7), 2010, pp. 3001-3022
Tractability and learnability arising from algebras with few subpowers
Paweƚ Idziak
,
Petar Marković
,
Ralph McKenzie
,
Matthew Valeriote
,
Ross Willard
SIAM Journal on Computing
39
(7), 2010, pp. 3023-3037
Adaptive local ratio
Julián Mestre
SIAM Journal on Computing
39
(7), 2010, pp. 3038-3057
Chosen-ciphertext security via correlated products
Alon Rosen
,
Gil Segev
SIAM Journal on Computing
39
(7), 2010, pp. 3058-3088
Quantum computation and the evaluation of tensor networks
Itai Arad
,
Zeph Landau
SIAM Journal on Computing
39
(7), 2010, pp. 3089-3121
Hardness amplification proofs require majority
Ronen Shaltiel
,
Emanuele Viola
SIAM Journal on Computing
39
(7), 2010, pp. 3122-3154
Approximate hypergraph partitioning and applications
Eldar Fischer
,
Arie Matsliah
,
Asaf Shapira
SIAM Journal on Computing
39
(7), 2010, pp. 3155-3185
Extensional uniformity for Boolean circuits
Pierre McKenzie
,
Michael Thomas
,
Heribert Vollmer
SIAM Journal on Computing
39
(7), 2010, pp. 3186-3206
Unique games with entangled provers are easy
Julia Kempe
,
Oded Regev
,
Ben Toner
SIAM Journal on Computing
39
(7), 2010, pp. 3207-3229
Locally testable codes require redundant testers
Eli Ben-Sasson
,
Venkatesan Guruswami
,
Tali Kaufman
,
Madhu Sudan
,
Michael Viderman
SIAM Journal on Computing
39
(7), 2010, pp. 3230-3247
Small-size
\epsilon
-nets for axis-parallel rectangles and boxes
Boris Aronov
,
Esther Ezra
,
Micha Sharir
SIAM Journal on Computing
39
(7), 2010, pp. 3248-3282
Line transversals of convex polyhedra in
\mathbb{R}^3
Haim Kaplan
,
Natan Rubin
,
Micha Sharir
SIAM Journal on Computing
39
(7), 2010, pp. 3283-3310
Server scheduling to balance priorities, fairness, and average quality of service
Nikhil Bansal
,
Kirk R. Pruhs
SIAM Journal on Computing
39
(7), 2010, pp. 3311-3335
A complexity dichotomy for partition functions with mixed signs
Leslie Ann Goldberg
,
Martin Grohe
,
Mark Jerrum
,
Marc Thurley
SIAM Journal on Computing
39
(7), 2010, pp. 3336-3402
Fault tolerant spanners for general graphs
S. Chechik
,
M. Langberg
,
D. Peleg
,
L. Roditty
SIAM Journal on Computing
39
(7), 2010, pp. 3403-3423
Seiten
<
1
2
3
4
5
6
>