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=J. Comput.~Syst.~Sci. AND Volume=72
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Real-valued multiple-instance learning with queries
Daniel R. Dooly
,
Sally A. Goldman
,
Stephen S. Kwek
Journal of Computer and System Sciences
72
(1), 2006, pp. 1-15
An improved approximation algorithm for vertex cover with hard capacities
Rajiv Gandhi
,
Eran Halperin
,
Samir Khuller
,
Guy Kortsarz
,
Aravind Srinivasan
Journal of Computer and System Sciences
72
(1), 2006, pp. 16-33
Bounded fixed-parameter tractability and
\log^2 n
nondeterministic bits
Jörg Flum
,
Martin Grohe
,
Mark Weyer
Journal of Computer and System Sciences
72
(1), 2006, pp. 34-71
The subsumption lattice and query learning
Roni Khardon
,
Marta Arias
Journal of Computer and System Sciences
72
(1), 2006, pp. 72-94
Sequential predictions based on algorithmic complexity
Marcus Hutter
Journal of Computer and System Sciences
72
(1), 2006, pp. 95-117
Minimizing maximum fiber requirement in optical networks
Matthew Andrews
,
Lisa Zhang
Journal of Computer and System Sciences
72
(1), 2006, pp. 118-131
Optimal preemptive scheduling for general target functions
Leah Epstein
,
Tamir Tassa
Journal of Computer and System Sciences
72
(1), 2006, pp. 132-162
The many faces of a translation
Pierre McKenzie
,
Thomas Schwentick
,
Denis Thérien
,
Heribert Vollmer
Journal of Computer and System Sciences
72
(1), 2006, pp. 163-179
Expand, enlarge and check: New algorithms for the coverability problem of WSTS
G. Geeraerts
,
J.-F. Raskin
,
L. Van Begin
Journal of Computer and System Sciences
72
(1), 2006, pp. 180-203
Hardness of approximating the shortest vector problem in high
l_p
norms
Subhash Khot
Journal of Computer and System Sciences
72
(2), 2006, pp. 206-219
Polynomial degree vs. quantum query complexity
Andris Ambainis
Journal of Computer and System Sciences
72
(2), 2006, pp. 220-238
On certain connectivity properties of the internet topology
Milena Mihail
,
Christos Papadimitriou
,
Amin Saberi
Journal of Computer and System Sciences
72
(2), 2006, pp. 239-251
Symmetric polynomials over
Z_m
and simultaneous communication protocols
Nayantara Bhatnagar
,
Parikshit Gopalan
,
Richard J. Lipton
Journal of Computer and System Sciences
72
(2), 2006, pp. 252-285
Logics for reasoning about cryptographic constructions
Russell Impagliazzo
,
Bruce M. Kapron
Journal of Computer and System Sciences
72
(2), 2006, pp. 286-320
Lower bounds for non-black-box zero knowledge
Boaz Barak
,
Yehuda Lindell
,
Salil Vadhan
Journal of Computer and System Sciences
72
(2), 2006, pp. 321-391
Simulated annealing in convex bodies and an
O ^\ast (n^4)
volume algorithm
László Lovász
,
Santosh Vempala
Journal of Computer and System Sciences
72
(2), 2006, pp. 392-417
Approximation algorithms for hierarchical location problems
C. Greg Plaxton
Journal of Computer and System Sciences
72
(3), 2006, pp. 425-443
How much can taxes help selfish routing?
Richard Cole
,
Yevgeniy Dodis
,
Tim Roughgarden
Journal of Computer and System Sciences
72
(3), 2006, pp. 444-467
Meet and merge: Approximation algorithms for confluent flows
Jiangzhuo Chen
,
Rajmohan Rajaraman
,
Ravi Sundaram
Journal of Computer and System Sciences
72
(3), 2006, pp. 468-489
Radio communication in random graphs
R. Elsässer
,
L. Ga̧sieniec
Journal of Computer and System Sciences
72
(3), 2006, pp. 490-506
TSP with bounded metrics
Lars Engebretsen
,
Marek Karpinski
Journal of Computer and System Sciences
72
(4), 2006, pp. 509-546
A parametric analysis of the state-explosion problem in model checking
S. Demri
,
F. Laroussinie
,
Ph. Schnoebelen
Journal of Computer and System Sciences
72
(4), 2006, pp. 547-575
Uniform generation in spatial constraint databases and applications
David Gross-Amblard
,
Michel de Rougemont
Journal of Computer and System Sciences
72
(4), 2006, pp. 576-591
Average probe complexity in quorum systems
Yehuda Hassin
,
David Peleg
Journal of Computer and System Sciences
72
(4), 2006, pp. 592-616
Infinite-state high-level MSCs: Model-checking and realizability
Blaise Genest
,
Anca Muscholl
,
Helmut Seidl
,
Marc Zeitoun
Journal of Computer and System Sciences
72
(4), 2006, pp. 617-647
Seiten 1
2
3
>