Columbia Univ., Dean of Engineering & Applied Science

http://www.cs.columbia.edu/~galil/

galil@cs.columbia.edu

Author, editor, or reviewer of:

- A linear time algorithm for concave one-dimensional dynamic programming
- Data structures and algorithms for disjoint set union problems
- Dynamic graph algorithms
- Dynamic programming with convexity, concavity and sparsity
- Efficient algorithms for sequence analysis
- Efficient algorithms with applications to molecular biology
- Fully dynamic algorithms for 2-edge-connectivity
- Fully dynamic planarity testing
- Fully dynamic planarity testing with applications
- Improved sparsification
- Maintaining biconnected components of dynamic planar graphs
- Maintaining the 3-edge connected components of a graph online
- Parallel algorithmic techniques for combinatorial computation
- Parallel algorithms for dynamic programming recurrences with more than $O(1)$ dependency
- Parallel dynamic programming
- Parallel string matching algorithms
- Separator based sparsification for dynamic planar graph algorithms
- Separator based sparsification I: planarity testing and minimum spanning trees
- Separator based sparsification II: edge and vertex connectivity
- Sparse dynamic programming
- Sparse dynamic programming I: linear cost functions
- Sparse dynamic programming II: convex and concave cost functions
- Sparsification — A technique for speeding up dynamic graph algorithms
- Speeding up dynamic programming
- Speeding up dynamic programming with applications to molecular biology
- Pattern Matching Algorithms
- Proc. 6th Symp. Combinatorial Pattern Matching (CPM 1995)