The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Uri Zwick: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Noga Alon, Raphael Yuster, Uri Zwick
    Color-Coding. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1995, v:42, n:4, pp:844-856 [Journal]
  2. Adi Avidor, Uri Zwick
    Rounding Two and Three Dimensional Solutions of the SDP Relaxation of MAX CUT. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:14-25 [Conf]
  3. Gábor Tardos, Uri Zwick
    The Communication Complexity of the Universal Relation. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:247-259 [Conf]
  4. Uri Zwick, Mike Paterson
    The Complexity of Mean Payoff Games. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:1-10 [Conf]
  5. Noga Alon, Raphael Yuster, Uri Zwick
    Finding and Counting Given Length Cycles (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:354-364 [Conf]
  6. Liam Roditty, Uri Zwick
    On Dynamic Shortest Paths Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:580-591 [Conf]
  7. Raphael Yuster, Uri Zwick
    Fast Sparse Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:604-615 [Conf]
  8. Uri Zwick
    Exact and Approximate Distances in Graphs - A Survey. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:33-48 [Conf]
  9. Dorit Dor, Shay Halperin, Uri Zwick
    All Pairs Almost Shortest Paths. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:452-461 [Conf]
  10. Dorit Dor, Uri Zwick
    Median Selection Requires (2+epsilon)n Comparisons. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:125-134 [Conf]
  11. Moshe Dubiner, Uri Zwick
    Amplification and Percolation [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:258-267 [Conf]
  12. Howard J. Karloff, Uri Zwick
    A 7/8-Approximation Algorithm for MAX 3SAT? [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:406-415 [Conf]
  13. Mike Paterson, Nicholas Pippenger, Uri Zwick
    Faster Circuits and Shorter Formulae for Multiple Addition, Multiplication and Symmetric Boolean Functions [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:642-650 [Conf]
  14. Mike Paterson, Uri Zwick
    Shrinkage of de~Morgan formulae under restriction [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:324-333 [Conf]
  15. Liam Roditty, Uri Zwick
    Improved Dynamic Reachability Algorithms for Directed Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:679-0 [Conf]
  16. Liam Roditty, Uri Zwick
    Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:499-508 [Conf]
  17. Avi Shoshan, Uri Zwick
    All Pairs Shortest Paths in Undirected Graphs with Integer Weights. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:605-615 [Conf]
  18. Raphael Yuster, Uri Zwick
    Answering distance queries in directed graphs using fast matrix multiplication. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:389-396 [Conf]
  19. Uri Zwick
    All Pairs Shortest Paths in Weighted Directed Graphs ¾ Exact and Almost Exact Algorithms. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:310-319 [Conf]
  20. Mike Paterson, Shlomit Tassa, Uri Zwick
    Looking for MUM and DAD: Text-Text Comparisons Do Help. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:1-10 [Conf]
  21. Uri Zwick
    Semidefinite Programming Based Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:57- [Conf]
  22. Stephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, Uri Zwick
    Union-Find with Constant Time Deletions. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:78-89 [Conf]
  23. Liam Roditty, Mikkel Thorup, Uri Zwick
    Deterministic Constructions of Approximate Distance Oracles and Spanners. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:261-272 [Conf]
  24. Liam Roditty, Uri Zwick
    Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:249-260 [Conf]
  25. Raphael Yuster, Uri Zwick
    Finding Even Cycles Even Faster. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:532-543 [Conf]
  26. Eran Halperin, Uri Zwick
    A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:210-225 [Conf]
  27. Eran Halperin, Uri Zwick
    Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:202-217 [Conf]
  28. Michael Lewin, Dror Livnat, Uri Zwick
    Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 2002, pp:67-82 [Conf]
  29. Adi Avidor, Uri Zwick
    Approximating MIN k-SAT. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:465-475 [Conf]
  30. Amitai Armon, Uri Zwick
    Multicriteria Global Minimum Cuts. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:65-76 [Conf]
  31. Uri Zwick
    A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:921-932 [Conf]
  32. Tal Goldberg, Uri Zwick
    Optimal deterministic approximate parallel prefix sums and their applications. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:220-228 [Conf]
  33. Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick
    Which Patterns are Hard to Find? [Citation Graph (0, 0)][DBLP]
    ISTCS, 1993, pp:59-68 [Conf]
  34. Dorit Dor, Uri Zwick
    Finding percentile elements. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:88-97 [Conf]
  35. Noga Alon, Benny Sudakov, Uri Zwick
    Constructing worst case instances for semidefinite programming based approximation algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:92-100 [Conf]
  36. Hana Chockler, Uri Zwick
    Which formulae shrink under random restrictions? [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:702-708 [Conf]
  37. Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick
    Reachability and distance queries via 2-hop labels. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:937-946 [Conf]
  38. Edith Cohen, Uri Zwick
    All-Pairs Small-Stretch Paths. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:93-102 [Conf]
  39. Dorit Dor, Uri Zwick
    Selecting the Median. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:28-37 [Conf]
  40. Eran Halperin, Dror Livnat, Uri Zwick
    MAX CUT in cubic graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:506-513 [Conf]
  41. Eran Halperin, Ram Nathaniel, Uri Zwick
    Coloring k-colorable graphs using smaller palettes. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:319-326 [Conf]
  42. Eran Halperin, Uri Zwick
    Combinatorial approximation algorithms for the maximum directed cut problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:1-7 [Conf]
  43. Shay Halperin, Uri Zwick
    Optimal randomized EREW PRAM Algorithms for Finding Spanning Forests and for other Basic Graph Connectivity Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:438-447 [Conf]
  44. Marcin Jurdzinski, Mike Paterson, Uri Zwick
    A deterministic subexponential algorithm for solving parity games. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:117-123 [Conf]
  45. Ashwin Nayak, Alistair Sinclair, Uri Zwick
    Spatial Codes and the Hardness of String Folding Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:639-648 [Conf]
  46. Ran Mendelson, Mikkel Thorup, Uri Zwick
    Meldable RAM priority queues and minimum directed spanning trees. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:40-48 [Conf]
  47. Mike Paterson, Uri Zwick
    Overhang. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:231-240 [Conf]
  48. Liam Roditty, Mikkel Thorup, Uri Zwick
    Roundtrip spanners and roundtrip routing in directed graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:844-851 [Conf]
  49. Mikkel Thorup, Uri Zwick
    Spanners and emulators with sublinear distance errors. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:802-809 [Conf]
  50. Raphael Yuster, Uri Zwick
    Detecting short directed cycles using rectangular matrix multiplication and dynamic programming. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:254-260 [Conf]
  51. Uri Zwick
    Jenga. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:243-246 [Conf]
  52. Uri Zwick
    Computer assisted proof of optimal approximability results. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:496-505 [Conf]
  53. Uri Zwick
    Approximation Algorithms for Constraint Satisfaction Problems Involving at Most Three Variables per Constraint. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:201-210 [Conf]
  54. Edith Cohen, Haim Kaplan, Uri Zwick
    Connection caching under vaious models of communication. [Citation Graph (0, 0)][DBLP]
    SPAA, 2000, pp:54-63 [Conf]
  55. Shay Halperin, Uri Zwick
    An Optimal Randomized Logarithmic Time Connectivity algorithm for the EREW PRAM (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1994, pp:1-10 [Conf]
  56. Mikkel Thorup, Uri Zwick
    Compact routing schemes. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:1-10 [Conf]
  57. Noga Alon, Raphael Yuster, Uri Zwick
    Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:326-335 [Conf]
  58. Edith Cohen, Haim Kaplan, Uri Zwick
    Connection Caching. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:612-621 [Conf]
  59. Mike Paterson, Uri Zwick
    Shallow Multiplication Circuits and Wise Financial Investments [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:429-437 [Conf]
  60. Liam Roditty, Uri Zwick
    A fully dynamic reachability algorithm for directed graphs with an almost linear update time. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:184-191 [Conf]
  61. Mikkel Thorup, Uri Zwick
    Approximate distance oracles. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:183-192 [Conf]
  62. Uri Zwick
    Finding Almost-Satisfying Assignments. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:551-560 [Conf]
  63. Uri Zwick
    All Pairs Lightest Shortest Paths. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:61-69 [Conf]
  64. Uri Zwick
    Outward Rotations: A Tool for Rounding Solutions of Semidefinite Programming Relaxations, with Applications to MAX CUT and Other Problems. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:679-687 [Conf]
  65. Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick
    Melding Priority Queues. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:223-235 [Conf]
  66. Edith Cohen, Haim Kaplan, Uri Zwick
    Competitive Analysis of the LRFU Paging Algorithm. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:148-154 [Conf]
  67. Adi Avidor, Ido Berkovitch, Uri Zwick
    Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT. [Citation Graph (0, 0)][DBLP]
    WAOA, 2005, pp:27-40 [Conf]
  68. Noga Alon, Raphael Yuster, Uri Zwick
    Finding and Counting Given Length Cycles. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:3, pp:209-223 [Journal]
  69. Edith Cohen, Haim Kaplan, Uri Zwick
    Competitive Analysis of the LRFU Paging Algorithm. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:4, pp:511-516 [Journal]
  70. Amitai Armon, Uri Zwick
    Multicriteria Global Minimum Cuts. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:46, n:1, pp:15-26 [Journal]
  71. Uri Zwick
    A Slightly Improved Sub-Cubic Algorithm for the All PairsShortest Paths Problem with Real Edge Lengths. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:46, n:2, pp:181-192 [Journal]
  72. Hana Chockler, Uri Zwick
    Which bases admit non-trivial shrinkage of formulae? [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2001, v:10, n:1, pp:28-40 [Journal]
  73. Mike Paterson, Uri Zwick
    Shallow Circuits and Concise Formulae for Multiple Addition and Multiplication. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1993, v:3, n:, pp:262-291 [Journal]
  74. Dorit Dor, Uri Zwick
    Finding The alpha n-Th Largest Element. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:1, pp:41-58 [Journal]
  75. Dorit Dor, Uri Zwick
    SOKOBAN and other motion planning problems. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:13, n:4, pp:215-228 [Journal]
  76. Uri Zwick
    All Pairs Shortest Paths using Bridging Sets and Rectangular Matrix Multiplication [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  77. Eran Halperin, Ram Nathaniel, Uri Zwick
    Coloring k-colorable graphs using relatively small palettes [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  78. Moshe Dubiner, Uri Zwick
    How Do Read-Once Formulae Shrink? [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:455-469 [Journal]
  79. Uri Zwick
    All Pairs Shortest Paths using Bridging Sets and Rectangular Matrix Multiplication [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:60, pp:- [Journal]
  80. Noga Alon, Raphael Yuster, Uri Zwick
    Color-Coding [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:9, pp:- [Journal]
  81. Uri Zwick, Mike Paterson
    The Complexity of Mean Payoff Games on Graphs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:40, pp:- [Journal]
  82. Dorit Dor, Shay Halperin, Uri Zwick
    All Pairs Almost Shortest Paths [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:40, pp:- [Journal]
  83. Uri Zwick
    An Extension of Khrapchenko's Theorem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:37, n:4, pp:215-217 [Journal]
  84. Uri Zwick
    On the Number of ANDs Versus the Number of ORs in Monotone Boolean Circuits. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:1, pp:29-30 [Journal]
  85. Mikkel Thorup, Uri Zwick
    Approximate distance oracles. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:1, pp:1-24 [Journal]
  86. Uri Zwick
    All pairs shortest paths using bridging sets and rectangular matrix multiplication. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2002, v:49, n:3, pp:289-317 [Journal]
  87. Edith Cohen, Uri Zwick
    All-Pairs Small-Stretch Paths. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:38, n:2, pp:335-353 [Journal]
  88. Tal Goldberg, Uri Zwick
    Faster Parallel String Matching via Larger Deterministic Samples. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:16, n:2, pp:295-308 [Journal]
  89. Eran Halperin, Dror Livnat, Uri Zwick
    MAX CUT in cubic graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:53, n:2, pp:169-185 [Journal]
  90. Eran Halperin, Ram Nathaniel, Uri Zwick
    Coloring k-colorable graphs using relatively small palettes. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:45, n:1, pp:72-90 [Journal]
  91. Shay Halperin, Uri Zwick
    Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:39, n:1, pp:1-46 [Journal]
  92. Eran Halperin, Uri Zwick
    Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:40, n:2, pp:184-211 [Journal]
  93. Ashwin Nayak, Alistair Sinclair, Uri Zwick
    Spatial Codes and the Hardness of String Folding Problems. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1999, v:6, n:1, pp:13-36 [Journal]
  94. Edith Cohen, Haim Kaplan, Uri Zwick
    Connection caching: model and algorithms. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:1, pp:92-126 [Journal]
  95. Shay Halperin, Uri Zwick
    An Optimal Randomised Logarithmic Time Connectivity Algorithm for the EREW PRAM. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:3, pp:395-416 [Journal]
  96. Amir M. Ben-Amram, Bryant A. Julstrom, Uri Zwick
    A Note on Busy Beavers and Other Creatures. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1996, v:29, n:4, pp:375-386 [Journal]
  97. Adi Avidor, Uri Zwick
    Approximating MIN 2-SAT and MIN 3-SAT. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2005, v:38, n:3, pp:329-345 [Journal]
  98. Eran Halperin, Uri Zwick
    A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:20, n:3, pp:382-402 [Journal]
  99. Mike Paterson, Uri Zwick
    Shrinkage of de Morgan Formulae under Restriction. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1993, v:4, n:2, pp:135-150 [Journal]
  100. Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick
    Reachability and Distance Queries via 2-Hop Labels. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:5, pp:1338-1355 [Journal]
  101. Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick
    Tighter Lower Bounds on the Exact Complexity of String Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:1, pp:30-45 [Journal]
  102. Moshe Dubiner, Uri Zwick
    Amplification by Read-Once Formulas. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:1, pp:15-38 [Journal]
  103. Dorit Dor, Shay Halperin, Uri Zwick
    All-Pairs Almost Shortest Paths. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:5, pp:1740-1759 [Journal]
  104. Dorit Dor, Uri Zwick
    Selecting the Median. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1722-1758 [Journal]
  105. Uri Zwick
    A 4n Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:3, pp:499-505 [Journal]
  106. Noga Alon, Benny Sudakov, Uri Zwick
    Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:15, n:1, pp:58-72 [Journal]
  107. Dorit Dor, Johan Håstad, Staffan Ulfberg, Uri Zwick
    On Lower Bounds for Selecting the Median. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:3, pp:299-311 [Journal]
  108. Dorit Dor, Uri Zwick
    Median Selection Requires (2+epsilon)n Comparisons. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:3, pp:312-325 [Journal]
  109. Raphael Yuster, Uri Zwick
    Finding Even Cycles Even Faster. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:2, pp:209-222 [Journal]
  110. Raphael Yuster, Uri Zwick
    Fast sparse matrix multiplication. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2005, v:1, n:1, pp:2-13 [Journal]
  111. Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick
    Melding priority queues. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:4, pp:535-556 [Journal]
  112. Noga Alon, Uri Zwick
    On Neciporuk's Theorem for Branching Programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:64, n:3, pp:331-342 [Journal]
  113. Uri Zwick
    The Smallest Networks on Which the Ford-Fulkerson Maximum Flow Procedure may Fail to Terminate. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:148, n:1, pp:165-170 [Journal]
  114. Uri Zwick, Mike Paterson
    The Memory Game. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:110, n:1, pp:169-196 [Journal]
  115. Uri Zwick, Mike Paterson
    The Complexity of Mean Payoff Games on Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:158, n:1&2, pp:343-359 [Journal]
  116. Zohar Naor, Hanoch Levy, Uri Zwick
    Cell Identification Codes for Tracking Mobile Users. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 2002, v:8, n:1, pp:73-84 [Journal]
  117. Asaf Shapira, Raphael Yuster, Uri Zwick
    All-pairs bottleneck paths in vertex weighted graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:978-985 [Conf]
  118. Amnon Ta-Shma, Uri Zwick
    Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:599-608 [Conf]
  119. Raphael Yuster, Uri Zwick
    Maximum matching in graphs with an excluded minor. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:108-117 [Conf]

  120. Simple Stochastic Games, Mean Payoff Games, Parity Games. [Citation Graph (, )][DBLP]


  121. New Bounds for the Nearly Equitable Edge Coloring Problem. [Citation Graph (, )][DBLP]


  122. Maximum overhang. [Citation Graph (, )][DBLP]


  123. A simpler implementation and analysis of Chazelle's soft heaps. [Citation Graph (, )][DBLP]


  124. Efficient algorithms for the 2-gathering problem. [Citation Graph (, )][DBLP]


  125. Discounted deterministic Markov decision processes and discounted all-pairs shortest paths. [Citation Graph (, )][DBLP]


  126. An Algorithm for Orienting Graphs Based on Cause-Effect Pairs and Its Applications to Orienting Protein Networks. [Citation Graph (, )][DBLP]


  127. Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor [Citation Graph (, )][DBLP]


Search in 1.735secs, Finished in 1.740secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002