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=28
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal biweighted binary trees and the complexity of maintaining partial sums
Haripriyan Hampapuram
,
Michael L. Fredman
SIAM Journal on Computing
28
(1), 1998, pp. 1-9
Dynamic 2-connectivity with backtracking
Johannes A. la Poutré
,
Jeffery Westbrook
SIAM Journal on Computing
28
(1), 1998, pp. 10-26
On the structure of
NP_c
Gregorio Malajovich
,
Klaus Meer
SIAM Journal on Computing
28
(1), 1998, pp. 27-35
Weighted
NP
optimization problems: Logical definability and approximation properties
Marius Zimand
SIAM Journal on Computing
28
(1), 1998, pp. 36-56
The computational structure of monotone monadic
SNP
and constraint satisfaction: A study through Datalog and group theory
Tomás Feder
,
Moshe Y. Vardi
SIAM Journal on Computing
28
(1), 1998, pp. 57-104
Asymptotically tight bounds for performing BMMC permutations on parallel disk systems
Thomas H. Cormen
,
Thomas Sundquist
,
Leonard F. Wisniewski
SIAM Journal on Computing
28
(1), 1998, pp. 105-136
L
-printable sets
Lance Fortnow
,
Judy Goldsmith
,
Matthew A. Levy
,
Stephen Mahaney
SIAM Journal on Computing
28
(1), 1998, pp. 137-151
The inverse satisfiability problem
Dimitris Kavvadias
,
Martha Sideri
SIAM Journal on Computing
28
(1), 1998, pp. 152-163
On syntactic versus computational views of approximability
Sanjeev Khanna
,
Rajeev Motwani
,
Madhu Sudan
,
Umesh Vazirani
SIAM Journal on Computing
28
(1), 1998, pp. 164-191
Maximum
k
-chains in planar point sets: Combinatorial structure and algorithms
Stefan Felsner
,
Lorenz Wernisch
SIAM Journal on Computing
28
(1), 1998, pp. 192-209
Fast algorithms for constructing
t
-spanners and paths with stretch
t
Edith Cohen
SIAM Journal on Computing
28
(1), 1998, pp. 210-236
Smart SMART bounds for weighted response time scheduling
Uwe Schwiegelshohn
,
Walter Ludwig
,
Joel L. Wolf
,
John Turek
,
Philip S. Yu
SIAM Journal on Computing
28
(1), 1998, pp. 237-253
New approximation guarantees for minimum-weight
k
-trees and prize-collecting salesmen
Baruch Awerbuch
,
Yossi Azar
,
Avrim Blum
,
Santosh Vempala
SIAM Journal on Computing
28
(1), 1998, pp. 254-262
Near-linear time construction of sparse neighborhood covers
Baruch Awerbuch
,
Bonnie Berger
,
Lenore Cowen
,
David Peleg
SIAM Journal on Computing
28
(1), 1998, pp. 263-277
Unoriented
\Theta
-maxima in the plane: Complexity and algorithms
David Avis
,
Bryan Beresford-Smith
,
Luc Devroye
,
Hossam Elgindy
,
Eric Guévremont
,
Ferran Hurtado
,
Binhai Zhu
SIAM Journal on Computing
28
(1), 1998, pp. 278-296
A spectral algorithm for seriation and the consecutive ones problem
Jonathan E. Atkins
,
Erik G. Boman
,
Bruce Hendrickson
SIAM Journal on Computing
28
(1), 1998, pp. 297-310
New collapse consequences of
NP
having small circuits
Johannes Köbler
,
Osamu Watanabe
SIAM Journal on Computing
28
(1), 1998, pp. 311-324
Sublogarithmic bounds on space and reversals
Viliam Geffert
,
Carlo Mereghetti
,
Giovanni Pighizzini
SIAM Journal on Computing
28
(1), 1998, pp. 325-340
Separator-based sparsification II: Edge and vertex connectivity
David Eppstein
,
Zvi Galil
,
Giuseppe F. Italiano
,
Thomas H. Spencer
SIAM Journal on Computing
28
(1), 1998, pp. 341-381
A downward collapse within the polynomial hierarchy
Edith Hemaspaandra
,
Lane A. Hemaspaandra
,
Harald Hempel
SIAM Journal on Computing
28
(2), 1998, pp. 383-393
Genericity, randomness, and polynomial-time approximations
Yongge Wang
SIAM Journal on Computing
28
(2), 1998, pp. 394-408
Universal limit laws for depths in random trees
Luc Devroye
SIAM Journal on Computing
28
(2), 1998, pp. 409-432
Average-case lower bounds for noisy Boolean decision trees
William Evans
,
Nicholas Pippenger
SIAM Journal on Computing
28
(2), 1998, pp. 433-446
Competitive algorithms for layered graph traversal
Amos Fiat
,
Dean P. Foster
,
Howard Karloff
,
Yuval Rabani
,
Yiftach Ravid
,
Sundar Vishwanathan
SIAM Journal on Computing
28
(2), 1998, pp. 447-462
On multirate rearrangeable Clos networks
D.Z. Du
,
B. Gao
,
F.K. Hwang
,
J.H. Kim
SIAM Journal on Computing
28
(2), 1998, pp. 463-470
Seiten 1
2
3
4
5
>