Roditty, Liam; Zwick, Uri A fully dynamic reachability algorithm for directed graphs with an almost linear update time. (English) Zbl 1342.05187 SIAM J. Comput. 45, No. 3, 712-733 (2016). MSC: 05C85 05C20 05C40 68Q25 90C35 PDFBibTeX XMLCite \textit{L. Roditty} and \textit{U. Zwick}, SIAM J. Comput. 45, No. 3, 712--733 (2016; Zbl 1342.05187) Full Text: DOI
Wilson, David B.; Zwick, Uri A forward-backward single-source shortest paths algorithm. (English) Zbl 1327.68138 SIAM J. Comput. 44, No. 3, 698-739 (2015). MSC: 68Q25 05C80 05C85 68Q87 PDFBibTeX XMLCite \textit{D. B. Wilson} and \textit{U. Zwick}, SIAM J. Comput. 44, No. 3, 698--739 (2015; Zbl 1327.68138) Full Text: DOI arXiv
Kaplan, Haim; Tarjan, Robert E.; Zwick, Uri Soft heaps simplified. (English) Zbl 1276.68063 SIAM J. Comput. 42, No. 4, 1660-1673 (2013). MSC: 68P05 PDFBibTeX XMLCite \textit{H. Kaplan} et al., SIAM J. Comput. 42, No. 4, 1660--1673 (2013; Zbl 1276.68063) Full Text: DOI
Roditty, Liam; Zwick, Uri Dynamic approximate all-pairs shortest paths in undirected graphs. (English) Zbl 1247.68340 SIAM J. Comput. 41, No. 3, 670-683 (2012). MSC: 68W40 68W20 05C85 68Q25 PDFBibTeX XMLCite \textit{L. Roditty} and \textit{U. Zwick}, SIAM J. Comput. 41, No. 3, 670--683 (2012; Zbl 1247.68340) Full Text: DOI
Jurdziński, Marcin; Paterson, Mike; Zwick, Uri A deterministic subexponential algorithm for solving parity games. (English) Zbl 1173.91326 SIAM J. Comput. 38, No. 4, 1519-1532 (2008). MSC: 91A43 91A05 91A50 68Q25 PDFBibTeX XMLCite \textit{M. Jurdziński} et al., SIAM J. Comput. 38, No. 4, 1519--1532 (2008; Zbl 1173.91326) Full Text: DOI
Roditty, Liam; Zwick, Uri Improved dynamic reachability algorithms for directed graphs. (English) Zbl 1225.68276 SIAM J. Comput. 37, No. 5, 1455-1471 (2008). MSC: 68W40 68W20 68W05 68Q25 PDFBibTeX XMLCite \textit{L. Roditty} and \textit{U. Zwick}, SIAM J. Comput. 37, No. 5, 1455--1471 (2008; Zbl 1225.68276) Full Text: DOI Link
Cohen, Edith; Halperin, Eran; Kaplan, Haim; Zwick, Uri Reachability and distance queries via 2-hop labels. (English) Zbl 1026.68165 SIAM J. Comput. 32, No. 5, 1338-1355 (2003). MSC: 68W40 68R99 PDFBibTeX XMLCite \textit{E. Cohen} et al., SIAM J. Comput. 32, No. 5, 1338--1355 (2003; Zbl 1026.68165) Full Text: DOI
Dor, Dorit; Halperin, Shay; Zwick, Uri All-pairs almost shortest paths. (English) Zbl 0948.05047 SIAM J. Comput. 29, No. 5, 1740-1759 (2000). MSC: 05C85 68Q25 68R10 05C38 PDFBibTeX XMLCite \textit{D. Dor} et al., SIAM J. Comput. 29, No. 5, 1740--1759 (2000; Zbl 0948.05047) Full Text: DOI
Dor, Dorit; Zwick, Uri Selecting the median. (English) Zbl 0933.68062 SIAM J. Comput. 28, No. 5, 1722-1758 (1999). MSC: 68Q25 68R05 06A07 PDFBibTeX XMLCite \textit{D. Dor} and \textit{U. Zwick}, SIAM J. Comput. 28, No. 5, 1722--1758 (1999; Zbl 0933.68062) Full Text: DOI
Dubiner, Moshe; Zwick, Uri Amplification by read-once formulas. (English) Zbl 0868.94059 SIAM J. Comput. 26, No. 1, 15-38 (1997). MSC: 94C10 06E30 68Q05 PDFBibTeX XMLCite \textit{M. Dubiner} and \textit{U. Zwick}, SIAM J. Comput. 26, No. 1, 15--38 (1997; Zbl 0868.94059) Full Text: DOI
Cole, Richard; Hariharan, Ramesh; Paterson, Mike; Zwick, Uri Tighter lower bounds on the exact complexity of string matching. (English) Zbl 0828.68100 SIAM J. Comput. 24, No. 1, 30-45 (1995). MSC: 68R15 68Q25 68U15 PDFBibTeX XMLCite \textit{R. Cole} et al., SIAM J. Comput. 24, No. 1, 30--45 (1995; Zbl 0828.68100) Full Text: DOI
Zwick, Uri A 4n lower bound on the combinational complexity of certain symmetric Boolean functions over the basis of unate dyadic Boolean functions. (English) Zbl 0734.68041 SIAM J. Comput. 20, No. 3, 499-505 (1991). MSC: 68Q15 94C10 PDFBibTeX XMLCite \textit{U. Zwick}, SIAM J. Comput. 20, No. 3, 499--505 (1991; Zbl 0734.68041) Full Text: DOI