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: Author="Zwick, Uri"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Listing triangles
Andreas Björklund
,
Rasmus Pagh
,
Virginia Vassilevska Williams
,
Uri Zwick
Lecture Notes in Computer Science
8572
, 2014, pp. 223-234
Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor
Thomas Dueholm Hansen
,
Peter Bro Miltersen
,
Uri Zwick
Journal of the ACM
60
(1), 2013, pp. 1: 1-16
Soft heaps simplified
Haim Kaplan
,
Robert E. Tarjan
,
Uri Zwick
SIAM Journal on Computing
42
(4), 2013, pp. 1660-1673
All-pairs shortest paths in
O(n^2)
time with high probability
Yuval Peres
,
Dmitry Sotnikov
,
Benny Sudakov
,
Uri Zwick
Journal of the ACM
60
(4), 2013, pp. 26: 1-25
Dynamic approximate all-pairs shortest paths in undirected graphs
Liam Roditty
,
Uri Zwick
SIAM Journal on Computing
41
(3), 2012, pp. 670-683
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm
Oliver Friedmann
,
Thomas Dueholm Hansen
,
Uri Zwick
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 283-292
On dynamic shortest paths problems
Liam Roditty
,
Uri Zwick
Algorithmica
61
(2), 2011, pp. 389-401
All-pairs bottleneck paths in vertex weighted graphs
Asaf Shapira
,
Raphael Yuster
,
Uri Zwick
Algorithmica
59
(4), 2011, pp. 621-633
Lower bounds for Howard's algorithm for finding minimum mean-cost cycles
Thomas Dueholm Hansen
,
Uri Zwick
Lecture Notes in Computer Science
6506
, 2010, pp. 415-426
A deterministic subexponential algorithm for solving parity games
Marcin Jurdziński
,
Mike Paterson
,
Uri Zwick
SIAM Journal on Computing
38
(4), 2008, pp. 1519-1532
Improved dynamic reachability algorithms for directed graphs
Liam Roditty
,
Uri Zwick
SIAM Journal on Computing
37
(5), 2008, pp. 1455-1471
New bounds for the nearly equitable edge coloring problem
Xuzhen Xie
,
Mutsunori Yagiura
,
Takao Ono
,
Tomio Hirata
,
Uri Zwick
Lecture Notes in Computer Science
4835
, 2007, pp. 280-291
Multicriteria global minimum cuts
Amitai Armon
,
Uri Zwick
Algorithmica
46
(1), 2006, pp. 15-26
A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths
Uri Zwick
Algorithmica
46
(2), 2006, pp. 181-192
Union-find with constant time deletions
Stephen Alstrup
,
Inge Li Grtz
,
Theis Rauhe
,
Mikkel Thorup
,
Uri Zwick
Lecture Notes in Computer Science
3580
, 2005, pp. 78-89
Approximating MIN 2-SAT and MIN 3-SAT
Adi Avidor
,
Uri Zwick
Theory of Computing Systems
38
(3), 2005, pp. 329-345
Deterministic constructions of approximate distance oracles and spanners
Liam Roditty
,
Mikkel Thorup
,
Uri Zwick
Lecture Notes in Computer Science
3580
, 2005, pp. 261-272
Replacement paths and
k
simple shortest paths in unweighted directed graphs
Liam Roditty
,
Uri Zwick
Lecture Notes in Computer Science
3580
, 2005, pp. 249-260
Approximate distance oracles
Mikkel Thorup
,
Uri Zwick
Journal of the ACM
52
(1), 2005, pp. 1-24
Multicriteria global minimum cuts
Amitai Armon
,
Uri Zwick
Lecture Notes in Computer Science
3341
, 2004, pp. 65-76
MAX CUT in cubic graphs
Eran Halperin
,
Dror Livnat
,
Uri Zwick
Journal of Algorithms
53
(2), 2004, pp. 169-185
Melding priority queues
Ran Mendelson
,
Robert E. Tarjan
,
Mikkel Thorup
,
Uri Zwick
Lecture Notes in Computer Science
3111
, 2004, pp. 223-235
On dynamic shortest paths problems
Liam Roditty
,
Uri Zwick
Lecture Notes in Computer Science
3221
, 2004, pp. 580-591
A fully dynamic reachability algorithm for directed graphs with an almost linear update time
Liam Roditty
,
Uri Zwick
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC'2004 (Chicago, Illinois, USA, June 13-15, 2004)
, 2004, pp. 184-191
Fast sparse matrix multiplication
Raphael Yuster
,
Uri Zwick
Lecture Notes in Computer Science
3221
, 2004, pp. 604-615
Seiten 1
2
3
4
5
6
7
>