Uri Zwick

From MaRDI portal
Person:233001

Available identifiers

zbMath Open zwick.uriWikidataQ30726757 ScholiaQ30726757MaRDI QIDQ233001

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61472792024-01-15Paper
The complexity of mean payoff games2023-12-12Paper
https://portal.mardi4nfdi.de/entity/Q50912562022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50912762022-07-21Paper
Pairing heaps: the forward variant.2021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q50095812021-08-04Paper
Public vs. private randomness in simultaneous multi-party communication complexity2020-02-06Paper
Faster k -SAT algorithms using biased-PPSZ2020-01-30Paper
A sort of an adversary2019-10-15Paper
Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles2019-06-20Paper
Improved upper bounds for Random-Edge and Random-Jump on abstract cubes2019-06-20Paper
https://portal.mardi4nfdi.de/entity/Q46338152019-05-06Paper
https://portal.mardi4nfdi.de/entity/Q46338572019-05-06Paper
https://portal.mardi4nfdi.de/entity/Q46339092019-05-06Paper
Finding even cycles even faster2019-04-29Paper
Adjacency Labeling Schemes and Induced-Universal Graphs2019-01-16Paper
Hollow Heaps2018-11-12Paper
Roundtrip spanners and roundtrip routing in directed graphs2018-11-05Paper
Union-Find with Constant Time Deletions2018-10-30Paper
Improved bounds for multipass pairing heaps and path-balanced binary search trees2018-06-22Paper
https://portal.mardi4nfdi.de/entity/Q46018792018-01-24Paper
Random-Edge Is Slower Than Random-Facet on Abstract Cubes2017-12-19Paper
The amortized cost of finding the minimum2017-10-05Paper
https://portal.mardi4nfdi.de/entity/Q53650382017-09-29Paper
https://portal.mardi4nfdi.de/entity/Q53650662017-09-29Paper
Looking for MUM and DAD: Text-text comparisons do help2017-01-19Paper
Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity2016-12-01Paper
All pairs lightest shortest paths2016-09-29Paper
Connection caching2016-09-29Paper
Outward rotations2016-09-29Paper
Color-coding2016-09-01Paper
A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time2016-06-01Paper
Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences2016-04-11Paper
All pairs shortest paths using bridging sets and rectangular matrix multiplication2015-12-07Paper
Hollow Heaps2015-10-27Paper
Fast sparse matrix multiplication2015-09-02Paper
Melding priority queues2015-09-02Paper
An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm2015-08-21Paper
Adjacency Labeling Schemes and Induced-Universal Graphs2015-08-21Paper
https://portal.mardi4nfdi.de/entity/Q55017852015-08-14Paper
https://portal.mardi4nfdi.de/entity/Q55012402015-08-03Paper
https://portal.mardi4nfdi.de/entity/Q55012662015-08-03Paper
A Forward-Backward Single-Source Shortest Paths Algorithm2015-06-11Paper
Approximate distance oracles2015-02-27Paper
https://portal.mardi4nfdi.de/entity/Q29345882014-12-18Paper
https://portal.mardi4nfdi.de/entity/Q29346432014-12-18Paper
https://portal.mardi4nfdi.de/entity/Q29346902014-12-18Paper
Efficient algorithms for the 2-gathering problem2014-11-18Paper
Replacement paths and k simple shortest paths in unweighted directed graphs2014-09-09Paper
Listing Triangles2014-07-01Paper
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm2014-06-05Paper
Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor2014-02-17Paper
All-Pairs Shortest Paths in $O(n^2)$ time with high probability2014-02-17Paper
Soft Heaps Simplified2013-11-14Paper
Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs2012-09-12Paper
On the Approximability of Reachability-Preserving Network Orientations2012-08-29Paper
Maximum Overhang2012-01-01Paper
On dynamic shortest paths problems2011-09-20Paper
All-pairs bottleneck paths in vertex weighted graphs2011-03-30Paper
Lower Bounds for Howard’s Algorithm for Finding Minimum Mean-Cost Cycles2010-12-09Paper
A deterministic subexponential algorithm for solving parity games2010-08-16Paper
Overhang2010-08-16Paper
Spanners and emulators with sublinear distance errors2010-08-16Paper
A fully dynamic reachability algorithm for directed graphs with an almost linear update time2010-08-15Paper
https://portal.mardi4nfdi.de/entity/Q35793832010-08-06Paper
A Deterministic Subexponential Algorithm for Solving Parity Games2009-08-20Paper
Overhang2009-02-26Paper
An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem2009-01-19Paper
Approximate distance oracles2008-12-21Paper
Improved Dynamic Reachability Algorithms for Directed Graphs2008-10-28Paper
New Bounds for the Nearly Equitable Edge Coloring Problem2008-05-27Paper
Approximation and Online Algorithms2007-02-12Paper
A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths2006-11-06Paper
Multicriteria global minimum cuts2006-10-16Paper
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques2006-07-07Paper
Automata, Languages and Programming2006-01-10Paper
Automata, Languages and Programming2006-01-10Paper
Automata, Languages and Programming2006-01-10Paper
Algorithms and Computation2005-12-22Paper
Algorithms and Computation2005-12-22Paper
Algorithm Theory - SWAT 20042005-09-07Paper
Algorithms – ESA 20042005-08-18Paper
Algorithms – ESA 20042005-08-18Paper
Approximating MIN 2-SAT and MIN 3-SAT2005-06-14Paper
MAX CUT in cubic graphs2005-02-16Paper
https://portal.mardi4nfdi.de/entity/Q48290212004-11-29Paper
https://portal.mardi4nfdi.de/entity/Q48290332004-11-29Paper
https://portal.mardi4nfdi.de/entity/Q48289382004-11-29Paper
https://portal.mardi4nfdi.de/entity/Q48289742004-11-29Paper
https://portal.mardi4nfdi.de/entity/Q48289752004-11-29Paper
https://portal.mardi4nfdi.de/entity/Q47375182004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44742062004-08-04Paper
Reachability and Distance Queries via 2-Hop Labels2003-09-28Paper
https://portal.mardi4nfdi.de/entity/Q27682652003-09-15Paper
https://portal.mardi4nfdi.de/entity/Q44278682003-09-14Paper
Connection caching: Model and algorithms.2003-08-19Paper
On the number of ANDs versus the number of ORs in monotone Boolean circuits2003-06-24Paper
Coloring -colorable graphs using relatively small palettes2003-05-14Paper
https://portal.mardi4nfdi.de/entity/Q47961652003-03-02Paper
Cell identification codes for tracking mobile users2003-02-19Paper
Competitive analysis of the LRFU paging algorithm2002-12-01Paper
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs2002-12-01Paper
https://portal.mardi4nfdi.de/entity/Q47785502002-11-18Paper
https://portal.mardi4nfdi.de/entity/Q27683122002-10-24Paper
https://portal.mardi4nfdi.de/entity/Q45425752002-08-01Paper
Which bases admit non-trivial shrinkage of formulae?2002-07-22Paper
A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems2002-07-01Paper
https://portal.mardi4nfdi.de/entity/Q45376992002-07-01Paper
Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms2002-04-23Paper
https://portal.mardi4nfdi.de/entity/Q27683682002-03-24Paper
https://portal.mardi4nfdi.de/entity/Q27682782002-01-30Paper
Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests2001-09-20Paper
All-Pairs Small-Stretch Paths2001-07-23Paper
On Lower Bounds for Selecting the Median2001-06-21Paper
Median Selection Requires $(2+\epsilon)n$ Comparisons2001-06-21Paper
All-Pairs Almost Shortest Paths2000-03-19Paper
https://portal.mardi4nfdi.de/entity/Q42501832000-02-09Paper
SOKOBAN and other motion planning problems2000-01-04Paper
Selecting the Median1999-10-28Paper
https://portal.mardi4nfdi.de/entity/Q42637131999-09-22Paper
https://portal.mardi4nfdi.de/entity/Q42502331999-08-16Paper
Amplification and percolation (probabilistic Boolean functions)1999-03-01Paper
Growth Functions and Automatic Groups1998-08-09Paper
Color-coding1998-01-28Paper
An optimal randomised logarithmic time connectivity algorithm for the EREW PRAM1997-09-07Paper
Amplification by Read-Once Formulas1997-08-17Paper
Finding Even Cycles Even Faster1997-05-26Paper
Finding and counting given length cycles1997-03-06Paper
The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate1997-02-28Paper
The complexity of mean payoff games on graphs1997-02-27Paper
https://portal.mardi4nfdi.de/entity/Q48860301996-12-12Paper
Finding the \(\alpha n\)-th largest element1996-10-07Paper
A note on busy beavers and other creatures1996-08-05Paper
https://portal.mardi4nfdi.de/entity/Q48752171996-04-28Paper
How Do Read-Once Formulae Shrink?1995-07-02Paper
Tighter Lower Bounds on the Exact Complexity of String Matching1995-03-27Paper
Shallow circuits and concise formulae for multiple addition and multiplication1994-11-29Paper
Faster Parallel String Matching via Larger Deterministic Samples1994-03-22Paper
The memory game1993-08-30Paper
Shrinkage of de Morgan formulae under restriction1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40367081993-05-18Paper
An extension of Khrapchenko's theorem1991-01-01Paper
A $4n$ Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions1991-01-01Paper
On Nečiporuk's theorem for branching programs1989-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Uri Zwick