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=38
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved approximation algorithms for minimum weight vertex separators
Uriel Feige
,
MohammadTaghi Hajiaghayi
,
James R. Lee
SIAM Journal on Computing
38
(2), 2008, pp. 629-657
Tree-walking automata do not recognize all regular languages
Mikoƚaj Bojańczyk
,
Thomas Colcombet
SIAM Journal on Computing
38
(2), 2008, pp. 658-701
New and improved constructions of nonmalleable cryptographic protocols
Rafael Pass
,
Alon Rosen
SIAM Journal on Computing
38
(2), 2008, pp. 702-752
Tensor norms and the classical communication complexity of nonlocal quantum measurement
Yaoyun Shi
,
Yufan Zhu
SIAM Journal on Computing
38
(3), 2008, pp. 753-766
I/O-efficient planar separators
Anil Maheshwari
,
Norbert Zeh
SIAM Journal on Computing
38
(3), 2008, pp. 767-801
Approximate shortest paths in anisotropic regions
Siu-Wing Cheng
,
Hyeon-Suk Na
,
Antoine Vigneron
,
Yajun Wang
SIAM Journal on Computing
38
(3), 2008, pp. 802-824
A primal-dual bicriteria distributed algorithm for capacitated vertex cover
F. Grandoni
,
J. Könemann
,
A. Panconesi
,
M. Sozio
SIAM Journal on Computing
38
(3), 2008, pp. 825-840
On the complexity of verifying consistency of XML specifications
Marcelo Arenas
,
Wenfei Fan
,
Leonid Libkin
SIAM Journal on Computing
38
(3), 2008, pp. 841-880
Competitive online approximation of the optimal search ratio
Rudolf Fleischer
,
Tom Kamphans
,
Rolf Klein
,
Elmar Langetepe
,
Gerhard Trippen
SIAM Journal on Computing
38
(3), 2008, pp. 881-898
On approximating the depth and related problems
Boris Aronov
,
Sariel Har-Peled
SIAM Journal on Computing
38
(3), 2008, pp. 899-921
Efficient algorithms for description problems over finite totally ordered domains
Angel J. Gil
,
Miki Hermann
,
Gernot Salzer
,
Bruno Zanuttini
SIAM Journal on Computing
38
(3), 2008, pp. 922-945
Approximating the spanning star forest problem and its application to genomic sequence alignment
C. Thach Nguyen
,
Jian Shen
,
Minmei Hou
,
Li Sheng
,
Webb Miller
,
Louxin Zhang
SIAM Journal on Computing
38
(3), 2008, pp. 946-962
Simulating quantum computation by contracting tensor networks
Igor L. Markov
,
Yaoyun Shi
SIAM Journal on Computing
38
(3), 2008, pp. 963-981
Efficient colored orthogonal range counting
Haim Kaplan
,
Natan Rubin
,
Micha Sharir
,
Elad Verbin
SIAM Journal on Computing
38
(3), 2008, pp. 982-1011
Finding branch-decompositions and rank-decompositions
Petr Hlinȇný
,
Sang-il Oum
SIAM Journal on Computing
38
(3), 2008, pp. 1012-1032
Query-efficient algorithms for polynomial interpolation over composites
Parikshit Gopalan
SIAM Journal on Computing
38
(3), 2008, pp. 1033-1057
Exact algorithms for treewidth and minimum fill-in
Fedor V. Fomin
,
Dieter Kratsch
,
Ioan Todinca
,
Yngve Villanger
SIAM Journal on Computing
38
(3), 2008, pp. 1058-1079
Dimensions of points in self-similar fractals
Jack H. Lutz
,
Elvira Mayordomo
SIAM Journal on Computing
38
(3), 2008, pp. 1080-1112
The complexity of monadic second-order unification
Jordi Levy
,
Manfred Schmidt-Schauß
,
Mateu Villaret
SIAM Journal on Computing
38
(3), 2008, pp. 1113-1140
The spectral method for general mixture models
Ravindran Kannan
,
Hadi Salmasian
,
Santosh Vempala
SIAM Journal on Computing
38
(3), 2008, pp. 1141-1156
Improved approximation algorithms for broadcast scheduling
Nikhil Bansal
,
Don Coppersmith
,
Maxim Sviridenko
SIAM Journal on Computing
38
(3), 2008, pp. 1157-1174
Geometric complexity theory II: Towards explicit obstructions for embeddings among class varieties
Ketan D. Mulmuley
,
Milind Sohoni
SIAM Journal on Computing
38
(3), 2008, pp. 1175-1206
Fault-tolerant quantum computation with constant error rate
Dorit Aharonov
,
Michael Ben-Or
SIAM Journal on Computing
38
(4), 2008, pp. 1207-1282
Mitotic classes in inductive inference
Sanjay Jain
,
Frank Stephan
SIAM Journal on Computing
38
(4), 2008, pp. 1283-1299
On monotone formula composition of perfect zero-knowledge languages
Alfredo De Santis
,
Giovanni Di Crescenzo
,
Giuseppe Persiano
,
Moti Yung
SIAM Journal on Computing
38
(4), 2008, pp. 1300-1329
Seiten
<
1
2
3
4
5
>