• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 216 matches

• 2025
• 
  Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick:
  On the Mysteries of MAX NAE-SAT. SIAM J. Discret. Math. 39(1): 267-313 (2025)
• 
  Virginia Vassilevska Williams, Zoe Xi, Yinzhan Xu, Uri Zwick:
  All-Hops Shortest Paths. SODA 2025: 5191-5206
• 2024
• 
  Robert E. Tarjan, Uri Zwick:
  Finding strong components using depth-first search. Eur. J. Comb. 119: 103815 (2024)
• 
  Robert E. Tarjan, Uri Zwick:
  Optimal Resizable Arrays. SIAM J. Comput. 53(5): 1354-1380 (2024)
• 
  Joshua Brakensiek, Neng Huang, Uri Zwick:
  Tight approximability of MAX 2-SAT and relatives, under UGC. SODA 2024: 1328-1344
• 
  Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick:
  Minimum-cost paths for electric cars. SOSA 2024: 374-382
• 
  Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick:
  Minimum-cost paths for electric cars. CoRR abs/2403.16936 (2024)
• 
  Virginia Vassilevska Williams, Zoe Xi, Yinzhan Xu, Uri Zwick:
  All-Hops Shortest Paths. CoRR abs/2410.23617 (2024)
• 2023
• 
  Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick:
  Optimal Energetic Paths for Electric Cars. ESA 2023: 42:1-42:17
• 
  Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick:
  Separating MAX 2-AND, MAX DI-CUT and MAX CUT. FOCS 2023: 234-252
• 
  Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick:
  Improved girth approximation in weighted undirected graphs. SODA 2023: 2242-2255
• 
  Robert E. Tarjan, Uri Zwick:
  Optimal resizable arrays. SOSA 2023: 285-304
• 
  Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick:
  Optimal energetic paths for electric cars. CoRR abs/2305.19015 (2023)
• 
  Joshua Brakensiek, Neng Huang, Uri Zwick:
  Tight approximability of MAX 2-SAT and relatives, under UGC. CoRR abs/2310.12911 (2023)
• 2022
• 
  Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick:
  Algorithmic trade-offs for girth approximation in undirected graphs. SODA 2022: 1471-1492
• 
  Haim Kaplan, Robert E. Tarjan, Or Zamir, Uri Zwick:
  Simulating a stack using queues. SODA 2022: 1901-1924
• 
  Robert E. Tarjan, Uri Zwick:
  Finding Strong Components Using Depth-First Search. CoRR abs/2201.07197 (2022)
• 
  Robert E. Tarjan, Uri Zwick:
  Optimal resizable arrays. CoRR abs/2211.11009 (2022)
• 
  Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick:
  Separating MAX 2-AND, MAX DI-CUT and MAX CUT. CoRR abs/2212.11191 (2022)
• 2021
• 
  Javier Esparza, Uri Zwick:
  TheoretiCS. Bull. EATCS 135 (2021)
• 
  Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick:
  On the Mysteries of MAX NAE-SAT. SODA 2021: 484-503
• 2020
• 
  Orr Fischer, Rotem Oshman, Uri Zwick:
  Public vs. private randomness in simultaneous multi-party communication complexity. Theor. Comput. Sci. 810: 72-81 (2020)
• 
  Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick:
  On the Mysteries of MAX NAE-SAT. CoRR abs/2009.10677 (2020)
• 2019
• 
  Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick:
  Adjacency Labeling Schemes and Induced-Universal Graphs. SIAM J. Discret. Math. 33(1): 116-137 (2019)
• 
  Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick:
  Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges. FOCS 2019: 896-909
• 
  Dani Dorfman, Haim Kaplan, Uri Zwick:
  A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games. ICALP 2019: 114:1-114:14
• 
  Mikkel Thorup, Or Zamir, Uri Zwick:
  Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps. ICALP 2019: 95:1-95:13
• 
  Haim Kaplan, László Kozma, Or Zamir, Uri Zwick:
  Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps. SOSA 2019: 5:1-5:21
• 
  Haim Kaplan, Or Zamir, Uri Zwick:
  A sort of an adversary. SODA 2019: 1291-1310
• 
  Thomas Dueholm Hansen, Haim Kaplan, Or Zamir, Uri Zwick:
  Faster k-SAT algorithms using biased-PPSZ. STOC 2019: 578-589

skipping 186 more matches