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="Peleg, David"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fault tolerant additive and
(\mu,\alpha)
-spanners
Gilad Braunschvig
,
Shiri Chechik
,
David Peleg
,
Adam Sealfon
Theoretical Computer Science
580
, 2015, pp. 94-100
The fault-tolerant capacitated
K
-center problem
Shiri Chechik
,
David Peleg
Theoretical Computer Science
566
, 2015, pp. 12-25
Distributed computing on core-periphery networks: Axiom-based design
Chen Avin
,
Michael Borokhovich
,
Zvi Lotker
,
David Peleg
Lecture Notes in Computer Science
8573
, 2014, pp. 399-410
Robust fault tolerant uncapacitated facility location
Shiri Chechik
,
David Peleg
Theoretical Computer Science
543
, 2014, pp. 9-23
Sublinear bounds for randomized leader election
Shay Kutten
,
Gopal Pandurangan
,
David Peleg
,
Peter Robinson
,
Amitabh Trehan
Theoretical Computer Science
561, Part B
, 2014, pp. 134-143
Exact weight subgraphs and the
k
-sum conjecture
Amir Abboud
,
Kevin Lewi
Lecture Notes in Computer Science
7965
, 2013, pp. 1-12
New online algorithms for story scheduling in web advertising
Susanne Albers
,
Achim Passen
Lecture Notes in Computer Science
7966
, 2013, pp. 446-458
Recent advances for a classical scheduling problem
Susanne Albers
Lecture Notes in Computer Science
7966
, 2013, pp. 4-14
Formalizing and reasoning about quality
Shaull Almagor
,
Udi Boker
,
Orna Kupferman
Lecture Notes in Computer Science
7966
, 2013, pp. 15-27
Decision problems for additive regular functions
Rajeev Alur
,
Mukund Raghothaman
Lecture Notes in Computer Science
7966
, 2013, pp. 37-48
Minimizing maximum (weighted) flow-time on related and unrelated machines
S. Anand
,
Karl Bringmann
,
Tobias Friedrich
,
Naveen Garg
,
Amit Kumar
Lecture Notes in Computer Science
7965
, 2013, pp. 13-24
Tight lower bound for linear sketches of moments
Alexandr Andoni
,
Huy L. Nguy
{\skew1\tilde{\mbox{\^e}}}
n
,
Yury Polyanskiy
,
Yihong Wu
Lecture Notes in Computer Science
7965
, 2013, pp. 25-32
Optimal partitioning for dual pivot quicksort
Martin Aumüller
,
Martin Dietzfelbinger
Lecture Notes in Computer Science
7965
, 2013, pp. 33-44
Space-time tradeoffs for subset sum: An improved worst case algorithm
Per Austrin
,
Petteri Kaski
,
Mikko Koivisto
,
Jussi Määttä
Lecture Notes in Computer Science
7965
, 2013, pp. 45-56
On the extension complexity of combinatorial polytopes
David Avis
,
Hans Raj Tiwary
Lecture Notes in Computer Science
7965
, 2013, pp. 57-68
Algorithms for hub label optimization
Maxim Babenko
,
Andrew V. Goldberg
,
Anupam Gupta
,
Viswanath Nagarajan
Lecture Notes in Computer Science
7965
, 2013, pp. 69-80
Sketching for big data recommender systems using fast pseudo-random fingerprints
Yoram Bachrach
,
Ely Porat
Lecture Notes in Computer Science
7966
, 2013, pp. 459-471
Beyond differential privacy: Composition theorems and relational logic for
f
-divergences between probabilistic programs
Gilles Barthe
,
Federico Olmedo
Lecture Notes in Computer Science
7966
, 2013, pp. 49-60
A maximal entropy stochastic process for a timed automaton
Nicolas Basset
Lecture Notes in Computer Science
7966
, 2013, pp. 61-73
Improved approximation algorithms for (budgeted) node-weighted Steiner problems
MohammadHossein Bateni
,
MohammadTaghi Hajiaghayi
,
Vahid Liaghat
Lecture Notes in Computer Science
7965
, 2013, pp. 81-92
Search-space size in contraction hierarchies
Reinhard Bauer
,
Tobias Columbus
,
Ignaz Rutter
,
Dorothea Wagner
Lecture Notes in Computer Science
7965
, 2013, pp. 93-104
Physarum can compute shortest paths: Convergence proofs and complexity bounds
Luca Becchetti
,
Vincenzo Bonifaci
,
Michael Dirnberger
,
Andreas Karrenbauer
,
Kurt Mehlhorn
Lecture Notes in Computer Science
7966
, 2013, pp. 472-483
Time-efficient quantum walks for 3-distinctness
Aleksandrs Belovs
,
Andrew M. Childs
,
Stacey Jeffery
,
Robin Kothari
,
Frédéric Magniez
Lecture Notes in Computer Science
7965
, 2013, pp. 105-122
Complexity of two-variable logic on finite trees
Saguy Benaim
,
Michael Benedikt
,
Witold Charatonik
,
Emanuel Kieroński
,
Rastislav Lenhardt
,
Philip Mazowiecki
,
James Worell
Lecture Notes in Computer Science
7966
, 2013, pp. 74-88
An algebraic characterization of testable Boolean CSPs
Arnab Bhattacharyya
,
Yuichi Yoshida
Lecture Notes in Computer Science
7965
, 2013, pp. 123-134
Seiten 1
2
3
4
5
6
7
8
9
10
11
12
>