- Finding Even Cycles Even Faster ? (Extended Abstract)
- Selecting the median Dorit Dor \Lambda Uri Zwick \Lambda
- Colorcoding \Lambda Noga Alon yz
- Jenga is a popular block game played by two players. Each player in her turn has to remove a block from a stack, without
- Shrinkage of de Morgan formulae under restriction \Lambda
- A 4n LOWER BOUND ON THE COMBINATIONAL COMPLEXITY OVER U 2 = B 2 f ; g OF CERTAIN SYMMETRIC BOOLEAN FUNCTIONS.
- Competitive analysis of the LRFU paging algorithm Edith Cohen Haim Kaplan Uri Zwick
- Detecting short directed cycles using rectangular matrix multiplication and dynamic programming
- Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint
- Finding and counting given length cycles ? (Extended Abstract)
- Coloring k-colorable graphs using smaller palettes Eran Halperin Ram Nathaniel Uri Zwick
- Improved rounding techniques for the MAX 2SAT and MAX DICUT problems #
- Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint
- The smallest networks on which the FordFulkerson maximum flow procedure may fail to terminate
- SHALLOW CIRCUITS AND CONCISE FORMULAE FOR MULTIPLE ADDITION
- CS277: Concrete Complexity Fall 1996 Lecture 56: September 10, 12, 1996
- Dynamic Approximate AllPairs Shortest Paths in Undirected Graphs
- CS277: Concrete Complexity Fall 1996 Lecture 15: October 22, 1996
- On the number of ANDs versus the number of ORs in monotone Boolean circuits
- On dynamic shortest paths problems Liam Roditty # Uri Zwick #
- CS277: Concrete Complexity Fall 1996 Lecture 3: September 3, 1996
- Approximate Distance Oracles Mikkel Thorup
- Combinatorial approximation algorithms for the maximum directed cut problem
- SOKOBAN and other motion planning problems Dorit Dor \Lambda Uri Zwick \Lambda
- Optimal deterministic approximate parallel prefix sums and their applications \Lambda
- Color-coding: a new method for nding simple paths, cycles and other small subgraphs within large graphs
- A 7=8Approximation Algorithm for MAX 3SAT? (Extended Abstract)
- Approximate Distance Oracles # Mikkel Thorup + Uri Zwick #
- Approximation algorithms for MAX 4SAT and rounding procedures for semidefinite programs \Lambda
- Which bases admit non-trivial shrinkage of formulae? Hana Chockler y Uri Zwick z
- Lecture notes for "Analysis of Algorithms": Dynamic All-Pairs Shortest Paths
- Amplification by ReadOnce Formulae Moshe Dubiner \Lambda Uri Zwick \Lambda
- Competitive Analysis of the LRFU Paging Edith Cohen 1 , Haim Kaplan 2 , and Uri Zwick 2
- Which formulae shrink under random restrictions? Hana Chockler y
- Connection Caching Edith Cohen Haim Kaplan Uri Zwick
- CS277: Concrete Complexity Fall 1996 Lectures 21--22: November 12--14, 1996
- Fast sparse matrix multiplication Raphael Yuster
- SELECTING THE MEDIAN DORIT DOR \Lambda AND URI ZWICK \Lambda
- CS277: Concrete Complexity Fall 1996 Lecture 19: November 5, 1996
- Roundtrip Spanners and Roundtrip Routing in Directed Graphs Liam Roditty Mikkel Thorup y Uri Zwick
- Approximation algorithms for MAX 4SAT and rounding procedures for semidefinite programs
- The Memory Game \Lambda Uri Zwick y
- CS277: Concrete Complexity Fall 1996 Lecture 11,12: October 1, 3, 1996
- CS277: CONCRETE COMPLEXITY TAKEHOME EXAM
- All Pairs Almost Shortest Paths Dorit Dor \Lambda Shay Halperin \Lambda Uri Zwick \Lambda
- CS277: Concrete Complexity Fall 1996 Lecture 1: August 27, 1996
- All Pairs Almost Shortest Paths \Lambda Dorit Dor y Shay Halperin y Uri Zwick y
- Melding priority queues Ran Mendelson
- Approximating MIN kSAT ? Adi Avidor and Uri Zwick
- AllPairs SmallStretch Paths \Lambda Edith Cohen y Uri Zwick z
- Outward rotations: a tool for rounding solutions of semidefinite programming relaxations,
- CS277: Concrete Complexity Fall 1996 Lecture 23: November 19, 1996
- How do readonce formulae shrink? Moshe Dubiner \Lambda Uri Zwick \Lambda
- On lower bounds for selecting the median Dorit Dor \Lambda Johan H#stad y Staoean Ulfberg y Uri Zwick \Lambda
- All Pairs Lightest Shortest Paths Uri Zwick \Lambda
- Mike Paterson How far off the edge of the table can we reach by
- Computer assisted proof of optimal approximability results We obtain computer assisted proofs of several spherical vol-
- Melding priority queues Ran Mendelson1
- Lecture notes for "Advanced Graph Algorithms": Verification of Minimum Spanning Trees
- Lecture notes for "Analysis of Algorithms": Global minimum cuts
- Analysis of Algorithms Problem Set no. 2 --Global minimum cuts
- Analysis of Algorithms Problem Set no. 3 --Dynamic All-Pairs Shortest Paths
- Melding priority queues Ran Mendelson # Robert E. Tarjan + Mikkel Thorup # Uri Zwick #
- CS277: Concrete Complexity Fall 1996 Lecture 7: September 17, 1996
- The complexity of mean payo games ? Uri Zwick 1 and Michael S. Paterson 2
- Reachability and distance queries via 2-hop labels Edith Cohen Eran Halperin y Haim Kaplan y Uri Zwick y
- Finding almost-satisfying assignments Uri Zwick
- Looking for MUM and DAD: text--text comparisons do help ?
- An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM
- Constructing worst case instances for semide nite programming based approximation algorithms
- MAX CUT in cubic graphs Eran Halperin
- Median Selection Requires (2+ )n Comparisons Department of Computer Science
- Optimal randomized EREW PRAM algorithms for finding spanning forests and for other
- A fully dynamic reachability algorithm for directed graphs with an almost linear update time #
- Optimal randomized EREW PRAM algorithms for finding spanning forests
- Exact and approximate distances in graphs { Uri Zwick ?
- Analysis of Algorithms Problem Set no. 1 --Minimum spanning trees
- Improved dynamic reachability algorithms for directed graphs Liam Roditty and Uri Zwick
- All Pairs Shortest Paths in weighted directed graphs --exact and almost exact algorithms
- Constructing worst case instances for semide nite programming based approximation algorithms
- | Boolean Circuit Complexity Fall Semester, 1994-5 | | Lecture 8: December 15 |
- | Boolean Circuit Complexity Fall Semester, 1994-5 | | Lecture 7: December 8 |
- Optimal Carry Save Networks Michael S. Paterson \Lambda Nicholas Pippenger y Uri Zwick z
- Compact routing schemes Mikkel Thorup
- All Pairs Shortest Paths in Undirected Graphs with Integer Weights
- The complexity of mean payoff games on graphs \Lambda Uri Zwick y Mike Paterson z
- Approximating MIN 2SAT and MIN 3SAT Adi Avidor Uri Zwick
- CS277: Concrete Complexity Fall 1996 Lecture 9: September 24, 1996
- A 7=8Approximation Algorithm for MAX 3SAT? Howard Karloff \Lambda Uri Zwick y
- Median selection requires (2+ffl)n comparisons Dorit Dor \Lambda Uri Zwick \Lambda
- CS277: Concrete Complexity Fall 1996 Lecture 17: October 29, 1996
- Spatial Codes and the Hardness of String Folding Problems \Lambda Ashwin Nayak y Alistair Sinclair z Uri Zwick x
- Which patterns are hard to nd? Richard Cole Ramesh Hariharan Michael S. Paterson y Uri Zwick z
- | Boolean Circuit Complexity Fall Semester, 1994-5 | | Lecture 3: November 10 |
- | Boolean Circuit Complexity Fall Semester, 1994-5 | | Lecture 12: 12 January |
- | Boolean Circuit Complexity Fall Semester, 1994-5 | | Lecture 1: October 27 |
- | Boolean Circuit Complexity Fall Semester, 1994-5 | | Lecture 10: December 29th |
- | Boolean Circuit Complexity Fall Semester, 1994-5 | | Lecture 5: November 24 |
- Amplification and Percolation Moshe Dubiner \Lambda Uri Zwick \Lambda
- A uni ed framework for obtaining improved approximation algorithms for maximum graph bisection problems
- Finding almostsatisfying assignments Uri Zwick \Lambda
- Lecture notes on: Maximum matching in
- Analyzing the MAX 2SAT and MAX DICUT approximation algorithms of Feige and Goemans
- Coloring k-colorable graphs using relatively small palettes Eran Halperin y Ram Nathaniel y Uri Zwick y
- Finding and counting given length cycles \Lambda Noga Alon y Raphael Yuster y Uri Zwick y
- A Uni ed Framework for Obtaining Improved Approximation Algorithms for Maximum Graph
- Finding the ffnth largest element Dorit Dor \Lambda Uri Zwick \Lambda
- An optimal randomised logarithmic time connectivity algorithm for the EREW PRAM
- | Boolean Circuit Complexity Fall Semester, 1994-5 | | Lecture 4: November 17 |
- BOOLEAN CIRCUIT COMPLEXITY TAKE-HOME EXAM
- | Boolean Circuit Complexity Fall Semester, 1994-5 | | Lecture 9: December 22 |
- | Boolean Circuit Complexity Fall Semester, 1994-5 | | Lecture 2: November 3 |
- | Boolean Circuit Complexity Fall Semester, 1994-5 | | Lecture 11: January 05 |
