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: Author="Yannakakis, M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algorithms for Boolean function query properties
Scott Aaronson
SIAM Journal on Computing
32
(5), 2003, pp. 1140-1157
Pseudotriangulations from surfaces and a novel type of edge flip
Oswin Aichholzer
,
Franz Aurenhammer
,
Hannes Krasser
,
Peter Brass
SIAM Journal on Computing
32
(6), 2003, pp. 1621-1653
The quantum communication complexity of sampling
Andris Ambainis
,
Leonard J. Schulman
,
Amnon Ta-Shma
,
Umesh Vazirani
,
Avi Wigderson
SIAM Journal on Computing
32
(6), 2003, pp. 1570-1585
Covering rectilinear polygons with axis-parallel rectangles
V.S. Anil Kumar
,
H. Ramesh
SIAM Journal on Computing
32
(6), 2003, pp. 1509-1541
Optimal external memory interval management
Lars Arge
,
Jeffrey Scott Vitter
SIAM Journal on Computing
32
(6), 2003, pp. 1488-1508
Approximation schemes for minimum latency problems
Sanjeev Arora
,
George Karakostas
SIAM Journal on Computing
32
(5), 2003, pp. 1317-1337
Expected-case complexity of approximate nearest neighbor searching
Sunil Arya
,
Ho-Yam Addy Fu
SIAM Journal on Computing
32
(3), 2003, pp. 793-815
Matrix rounding under the
L_p
-discrepancy measure and its application to digital halftoning
Tetsuo Asano
,
Naoki Katoh
,
Koji Obokata
,
Takeshi Tokuyama
SIAM Journal on Computing
32
(6), 2003, pp. 1423-1435
Windows scheduling problems for broadcast systems
Amotz Bar-Noy
,
Richard E. Ladner
SIAM Journal on Computing
32
(4), 2003, pp. 1091-1113
The natural work-stealing algorithm is stable
Petra Berenbrink
,
Tom Friedetzky
,
Leslie Ann Goldberg
SIAM Journal on Computing
32
(5), 2003, pp. 1260-1279
Finding a path of superlogarithmic length
Andreas Björklund
,
Thore Husfeldt
SIAM Journal on Computing
32
(6), 2003, pp. 1395-1402
Arc-disjoint paths in expander digraphs
Tom Bohman
,
Alan Frieze
SIAM Journal on Computing
32
(2), 2003, pp. 326-344
Identity-based encryption from the Weil pairing
Dan Boneh
,
Matthew Franklin
SIAM Journal on Computing
32
(3), 2003, pp. 586-615
Parallel processor scheduling with limited number of preemptions
Oliver Braun
,
Günter Schmidt
SIAM Journal on Computing
32
(3), 2003, pp. 671-680
Rearrangeability of
(2n-1)
-stage shuffle-exchange networks
Hasan Çam
SIAM Journal on Computing
32
(3), 2003, pp. 557-585
Semi-online maintenance of geometric optima and measures
Timothy M. Chan
SIAM Journal on Computing
32
(3), 2003, pp. 700-716
Common-face embeddings of planar graphs
Zhi-Zhong Chen
,
Xin He
,
Ming-Yang Kao
SIAM Journal on Computing
32
(2), 2003, pp. 408-434
Computing phylogenetic roots with bounded degrees and errors
Zhi-Zhong Chen
,
Tao Jiang
,
Guohui Lin
SIAM Journal on Computing
32
(4), 2003, pp. 864-879
An approximation algorithm for the minimum-cost
k
-vertex connected subgraph
Joseph Cheriyan
,
Santosh Vempala
,
Adrian Vetta
SIAM Journal on Computing
32
(4), 2003, pp. 1050-1055
Partial match queries in random quadtrees
Hua-Huai Chern
,
Hsien-Kuei Hwang
SIAM Journal on Computing
32
(4), 2003, pp. 904-915
Reachability and distance queries via 2-hop labels
Edith Cohen
,
Eran Halperin
,
Haim Kaplan
,
Uri Zwick
SIAM Journal on Computing
32
(5), 2003, pp. 1338-1355
Tree pattern matching to subset matching in linear time
Richard Cole
,
Ramesh Hariharan
SIAM Journal on Computing
32
(4), 2003, pp. 1056-1066
A subquadratic sequence alignment algorithm for unrestricted scoring matrices
Maxime Crochemore
,
Gad M. Landau
,
Michal Ziv-Ukelson
SIAM Journal on Computing
32
(6), 2003, pp. 1654-1673
Genetic design of drugs without side-effects
Xiaotie Deng
,
Guojun Li
,
Zimao Li
,
Bin Ma
,
Lusheng Wang
SIAM Journal on Computing
32
(4), 2003, pp. 1073-1090
The expected number of 3D visibility events is linear
Olivier Devillers
,
Vida Dujmovic
,
Hazel Everett
,
Xavier Goaoc
,
Sylvain Lazard
,
Hyeon-Suk Na
,
Sylvain Petitjean
SIAM Journal on Computing
32
(6), 2003, pp. 1586-1620
Seiten 1
2
3
4
5
6
7
8
9
10
11
12
>