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 YEAR=2002
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algorithms for capacitated vehicle routing
Moses Charikar
,
Samir Khuller
,
Balaji Raghavachari
SIAM Journal on Computing
31
(3), 2001-2002, pp. 665-682
Optimal sampling strategies in Quicksort and Quickselect
Conrado Martínez
,
Salvador Roura
SIAM Journal on Computing
31
(3), 2001-2002, pp. 683-705
The compactness of interval routing for almost all graphs
Cyril Gavoille
,
David Peleg
SIAM Journal on Computing
31
(3), 2001-2002, pp. 706-721
Topological lower bounds on algebraic random access machines
Amir M. Ben-Amram
,
Zvi Galil
SIAM Journal on Computing
31
(3), 2001-2002, pp. 722-761
Succinct representation of balanced parentheses and static trees
J. Ian Munro
,
Venkatesh Raman
SIAM Journal on Computing
31
(3), 2001-2002, pp. 762-776
Temporal logic and semidirect products: An effective characterization of the until hierarchy
Denis Thérien
,
Thomas Wilke
SIAM Journal on Computing
31
(3), 2001-2002, pp. 777-798
Parallel quantum computation and quantum codes
Cristopher Moore
,
Martin Nilsson
SIAM Journal on Computing
31
(3), 2001-2002, pp. 799-815
Analysis of timing-based mutual exclusion with random times
Eli Gafni
,
Michael Mitzenmacher
SIAM Journal on Computing
31
(3), 2001-2002, pp. 816-837
A characterization of eventual Byzantine agreement
Joseph Y. Halpern
,
Yoram Moses
,
Orli Waarts
SIAM Journal on Computing
31
(3), 2001-2002, pp. 838-865
Evasiveness of subgraph containment and related properties
Amit Chakrabarti
,
Subhash Khot
,
Yaoyun Shi
SIAM Journal on Computing
31
(3), 2001-2002, pp. 866-875
Compressibility and resource bounded measure
Harry Buhrman
,
Luc Longpré
SIAM Journal on Computing
31
(3), 2001-2002, pp. 876-886
Resource-bounded Kolmogorov complexity revisited
Harry Buhrman
,
Lance Fortnow
,
Sophie Laplante
SIAM Journal on Computing
31
(3), 2001-2002, pp. 887-905
Separation of
NP
-completeness notions
A. Pavan
,
Alan L. Selman
SIAM Journal on Computing
31
(3), 2001-2002, pp. 906-918
Approximation algorithms for single-source unsplittable flow
Stavros G. Kolliopoulos
,
Clifford Stein
SIAM Journal on Computing
31
(3), 2001-2002, pp. 919-946
Proof techniques for cryptographic processes
Michele Boreale
,
Rocco de Nicola
,
Rosario Pugliese
SIAM Journal on Computing
31
(3), 2001-2002, pp. 947-986
Erratum to ''Proximity in arrangements of algebraic sets''
J.H. Rieger
SIAM Journal on Computing
31
(3), 2001-2002, pp. 987-987
Erratum to ''Edge-disjoint paths in expander graphs''
Alan Frieze
SIAM Journal on Computing
31
(3), 2001-2002, pp. 988-988
A layered analysis of consensus
Yoram Moses
,
Sergio Rajsbaum
SIAM Journal on Computing
31
(4), 2002, pp. 989-1021
On binary searching with nonuniform costs
Eduardo S. Laber
,
Ruy L. Milidiú
,
Artur A. Pessoa
SIAM Journal on Computing
31
(4), 2002, pp. 1022-1047
The efficiency of resolution and Davis-Putnam procedures
Paul Beame
,
Richard Karp
,
Toniann Pitassi
,
Michael Saks
SIAM Journal on Computing
31
(4), 2002, pp. 1048-1075
A decision procedure for unitary linear quantum cellular automata
Christoph Dürr
,
Miklos Santha
SIAM Journal on Computing
31
(4), 2002, pp. 1076-1089
A polylogarithmic approximation of the minimum bisection
Uriel Feige
,
Robert Krauthgamer
SIAM Journal on Computing
31
(4), 2002, pp. 1090-1118
Lattice embeddings for abstract bounded reducibilities
Wolfgang Merkle
SIAM Journal on Computing
31
(4), 2002, pp. 1119-1155
Decidability of termination of grid string rewriting rules
Alfons Geser
SIAM Journal on Computing
31
(4), 2002, pp. 1156-1168
Randomness, computability, and density
Rod G. Downey
,
Denis R. Hirschfeldt
,
André Nies
SIAM Journal on Computing
31
(4), 2002, pp. 1169-1183
Seiten 1
2
3
>