Philip N. Klein Home Page Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2013
i11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Glencora Borradaile, Philip N. Klein: The two-edge connectivity survivable-network design problem in planar graphs. CoRR abs/1302.2184 (2013)
i10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Glencora Borradaile, Philip N. Klein, Claire Mathieu: A polynomial-time approximation scheme for Euclidean Steiner forest. CoRR abs/1302.7270 (2013)
2012
c50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Dániel Marx: Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time. ICALP (1) 2012: 569-580
c49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
David Eisenstat, Philip N. Klein, Claire Mathieu: An efficient polynomial-time approximation scheme for Steiner forest in planar graphs. SODA 2012: 626-638
c48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Philip N. Klein, Claire Mathieu: A polynomial-time approximation scheme for planar multiway cut. SODA 2012: 639-655
i9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Shay Mozes, Christian Sommer: Structured Recursive Separator Decompositions for Planar Graphs in Linear Time. CoRR abs/1208.2223 (2012)
2011
c47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen: Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. FOCS 2011: 170-179
c46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Ken-ichi Kawarabayashi, Philip N. Klein, Christian Sommer: Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs. ICALP (1) 2011: 135-146
c45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Shay Mozes: Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time. WADS 2011: 571-582
i8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Shay Mozes: Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter*n*log(n)) Time. CoRR abs/1104.4728 (2011)
i7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Ken-ichi Kawarabayashi, Philip N. Klein, Christian Sommer: Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus, and Minor-Free Graphs. CoRR abs/1104.5214 (2011)
i6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen: Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. CoRR abs/1105.2228 (2011)
i5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
David Eisenstat, Philip N. Klein, Claire Mathieu: An efficient polynomial-time approximation scheme for Steiner forest in planar graphs. CoRR abs/1110.1320 (2011)
2010
j28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Shay Mozes, Oren Weimann: Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log2 n)-time algorithm. ACM Transactions on Algorithms 6(2) (2010)
i4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Shay Mozes: Multiple-source single-sink maximum flow in directed planar graphs in $O(n^{1.5} \log n)$ time. CoRR abs/1008.5332 (2010)
2009
j27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Glencora Borradaile, Philip N. Klein: An O(n log n) algorithm for maximum st-flow in a directed planar graph. J. ACM 56(2) (2009)
j26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Glencora Borradaile, Philip N. Klein, Claire Mathieu: An O(n log n) approximation scheme for Steiner tree in planar graphs. ACM Transactions on Algorithms 5(3) (2009)
c44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip N. Klein: Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs. ICALP (1) 2009: 328-340
c43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Shay Mozes, Oren Weimann: Shortest paths in directed planar graphs with negative lengths: a linear-space O(n log2 n)-time algorithm. SODA 2009: 236-245
2008
j25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein: A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights. SIAM J. Comput. 37(6): 1926-1952 (2008)
c42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Glencora Borradaile, Philip N. Klein, Claire Mathieu: A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest. FOCS 2008: 115-124
c41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Glencora Borradaile, Philip N. Klein: The Two-Edge Connectivity Survivable Network Problem in Planar Graphs. ICALP (1) 2008: 485-501
2007
c40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Glencora Borradaile, Claire Kenyon-Mathieu, Philip N. Klein: A polynomial-time approximation scheme for Steiner tree in planar graphs. SODA 2007: 1285-1294
c39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Glencora Borradaile, Philip N. Klein, Claire Mathieu: Steiner Tree in Planar Graphs: An O ( n log n ) Approximation Scheme with Singly-Exponential Dependence on Epsilon. WADS 2007: 275-286
2006
c38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Glencora Borradaile, Philip N. Klein: An O (n log n) algorithm for maximum st-flow in a directed planar graph. SODA 2006: 524-533
c37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein: A subset spanner for Planar graphs, : with application to subset TSP. STOC 2006: 749-756
2005
c36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein: A linear-time approximation scheme for planar weighted TSP. FOCS 2005: 647-657
c35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein: Multiple-source shortest paths in planar graphs. SODA 2005: 146-155
2004
j24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young: Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. Math. Oper. Res. 29(3): 436-461 (2004)
j23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Radha Krishnan, Balaji Raghavachari, R. Ravi: Approximation algorithms for finding low-degree subgraphs. Networks 44(3): 203-215 (2004)
j22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas B. Sebastian, Philip N. Klein, Benjamin B. Kimia: Recognition of Shapes by Editing Their Shock Graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26(5): 550-571 (2004)
2003
j21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Robert H. B. Netzer, Hsueh-I Lu: Detecting Race Conditions in Parallel Programs that Use Semaphores. Algorithmica 35(4): 321-345 (2003)
j20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas B. Sebastian, Philip N. Klein, Benjamin B. Kimia: On Aligning Curves. IEEE Trans. Pattern Anal. Mach. Intell. 25(1): 116-125 (2003)
2002
c34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas B. Sebastian, Philip N. Klein, Benjamin B. Kimia: Shock-Based Indexing into Large Shape Databases. ECCV (3) 2002: 731-746
c33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein: Preprocessing an undirected planar network to enable fast approximate distance queries. SODA 2002: 820-827
i3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Neal E. Young: On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms. CoRR cs.DS/0205046 (2002)
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young: Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. CoRR cs.DS/0205051 (2002)
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Hsueh-I Lu, Robert H. B. Netzer: Detecting Race Conditions in Parallel Programs that Use Semaphores. CoRR cs.DS/0208004 (2002)
2001
c32no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas B. Sebastian, Philip N. Klein, Benjamin B. Kimia: Recognition of Shapes by Editing Shock Graphs. ICCV 2001: 755-762
c31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas B. Sebastian, Philip N. Klein, Benjamin B. Kimia: Alignment-Based Recognition of Shape Outlines. IWVF 2001: 606-618
c30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Thomas B. Sebastian, Benjamin B. Kimia: Shape matching using edit-distance: an implementation. SODA 2001: 781-790
2000
c29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas W. Doeppner Jr., Philip N. Klein, Andrew Koyfman: Using router stamping to identify the source of IP packets. ACM Conference on Computer and Communications Security 2000: 184-189
c28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Srikanta Tirthapura, Daniel Sharvit, Benjamin B. Kimia: A tree-edit-distance algorithm for comparing simple, closed shapes. SODA 2000: 696-704
c27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein: Finding the closest lattice vector when it's unusually close. SODA 2000: 937-941
1999
c26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Neal E. Young: On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms. IPCO 1999: 320-327
c25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young: Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. STOC 1999: 668-678
1998
j19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Sairam Subramanian: A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs. Algorithmica 22(3): 235-249 (1998)
c24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein: Computing the Edit-Distance between Unrooted Ordered Trees. ESA 1998: 91-102
c23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Hsueh-I Lu: Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs. ISAAC 1998: 387-396
c22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Sanjeev Arora, Michelangelo Grigni, David R. Karger, Philip N. Klein, Andrzej Woloszyn: A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP. SODA 1998: 33-41
1997
j18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Serge A. Plotkin, Satish Rao, Éva Tardos: Approximation Algorithms for Steiner and Directed Multicuts. J. Algorithms 22(2): 241-269 (1997)
j17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Sairam Subramanian: A Randomized Parallel Algorithm for Single-Source Shortest Paths. J. Algorithms 25(2): 205-220 (1997)
j16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Monika Rauch Henzinger, Philip N. Klein, Satish Rao, Sairam Subramanian: Faster Shortest-Path Algorithms for Planar Graphs. J. Comput. Syst. Sci. 55(1): 3-23 (1997)
1996
j15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein: Efficient Parallel Algorithms for Chordal Graphs. SIAM J. Comput. 25(4): 797-827 (1996)
c21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Hsueh-I Lu, Robert H. B. Netzer: Race-Condition Detection in Parallel Computation with Semaphores (Extended Abstract). ESA 1996: 445-459
c20no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Richard Cole, Philip N. Klein, Robert Endre Tarjan: Finding Minimum Spanning Forests in Logarithmic Time and Linear Work Using Random Sampling. SPAA 1996: 243-250
c19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Hsueh-I Lu: Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING. STOC 1996: 338-347
1995
j14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Satish Rao, Ajit Agrawal, R. Ravi: An Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications. Combinatorica 15(2): 187-202 (1995)
j13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
David R. Karger, Philip N. Klein, Robert Endre Tarjan: A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees. J. ACM 42(2): 321-328 (1995)
j12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, R. Ravi: A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees. J. Algorithms 19(1): 104-115 (1995)
j11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Ajit Agrawal, Philip N. Klein, R. Ravi: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks. SIAM J. Comput. 24(3): 440-456 (1995)
1994
j10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein: A Data Structure for Bicategories, with Application to Speeding up an Approximation Algorithm. Inf. Process. Lett. 52(6): 303-307 (1994)
j9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Serge A. Plotkin, Clifford Stein, Éva Tardos: Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts. SIAM J. Comput. 23(3): 466-487 (1994)
c18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Robert Endre Tarjan: A randomized linear-time algorithm for finding minimum spanning trees. STOC 1994: 9-15
c17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Satish Rao, Monika Rauch Henzinger, Sairam Subramanian: Faster shortest-path algorithms for planar graphs. STOC 1994: 27-37
1993
j8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Clifford Stein: A Parallel Algorithm for Approximating the Minimum Cycle Cover. Algorithmica 9(1): 23-31 (1993)
j7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein: Parallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs. J. Algorithms 14(3): 331-343 (1993)
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Ming-Yang Kao, Philip N. Klein: Towards Overcoming the Transitive-Closure Bottleneck: Efficient Parallel Algorithms for Planar Digraphs. J. Comput. Syst. Sci. 47(3): 459-500 (1993)
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Samir Khuller, Joseph Naor, Philip N. Klein: The Lattice Structure of Flow in Planar Graphs. SIAM J. Discrete Math. 6(3): 477-490 (1993)
c16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Sairam Subramanian: A linear-processor polylog-time algorithm for shortest paths in planar graphs. FOCS 1993: 259-270
c15no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, R. Ravi: When cycles collapse: A general approximation technique for constrained two-connectivity problems. IPCO 1993: 39-55
c14no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, R. Ravi: A nearly best-possible approximation algorithm for node-weighted Steiner trees. IPCO 1993: 323-332
c13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein: On Gazit and Miller's Parallel Algorithm for Planar Separators: Achieving Greater Efficiency Through Random Sampling. SPAA 1993: 43-49
c12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Serge A. Plotkin, Satish Rao: Excluded minors, network decomposition, and multicommodity flow. STOC 1993: 682-690
c11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Sairam Subramanian: A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs. WADS 1993: 442-451
c10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hsueh-I Lu, Philip N. Klein, Robert H. B. Netzer: Detecting Race Conditions in Parallel Programs that Use One Semaphore. WADS 1993: 471-482
1992
c9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
R. Ravi, Balaji Raghavachari, Philip N. Klein: Approximation Through Local Optimality: Designing Networks with Small Degree. FSTTCS 1992: 279-290
c8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Sairam Sairam: A Parallel Randomized Approximation Scheme for Shortest Paths. STOC 1992: 750-758
1991
c7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
R. Ravi, Ajit Agrawal, Philip N. Klein: Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion. ICALP 1991: 751-762
c6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Ajit Agrawal, Philip N. Klein, R. Ravi: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks. STOC 1991: 134-144
1990
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Clifford Stein: A Parallel Algorithm for Eliminating Cycles in Undirected Graphs. Inf. Process. Lett. 34(6): 307-312 (1990)
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Lisa Hellerstein, Philip N. Klein, Robert Wilber: On the Time-Space Complexity of Reachability Queries for Preprocessed Graphs. Inf. Process. Lett. 35(5): 261-267 (1990)
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Ajit Agrawal, R. Ravi, Satish Rao: Approximation through Multicommodity Flow. FOCS 1990: 726-737
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Ming-Yang Kao, Philip N. Klein: Towards Overcoming the Transitive-Closure Bottleneck: Efficient Parallel Algorithms for Planar Digraphs. STOC 1990: 181-192
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, Clifford Stein, Éva Tardos: Leighton-Rao Might Be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities. STOC 1990: 310-321
1988
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, John H. Reif: An Efficient Parallel Algorithm for Planarity. J. Comput. Syst. Sci. 37(2): 190-246 (1988)
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, John H. Reif: Parallel Time O(log n) Acceptance of Deterministic CFLs on an Exclusive-Write P-RAM. SIAM J. Comput. 17(3): 463-485 (1988)
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein: Efficient Parallel Algorithms for Chordal Graphs. FOCS 1988: 150-161
1986
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Philip N. Klein, John H. Reif: An Efficient Parallel Algorithm for Planarity. FOCS 1986: 465-477

Coauthor Index

1Ajit Agrawal
[j14] [j11] [c7] [c6] [c5]
2Sanjeev Arora
[c22]
3MohammadHossein Bateni
[c48]
4Glencora Borradaile
[i11] [i10] [c47] [i6] [j27] [j26] [c42] [c41] [c40] [c39] [c38]
5Richard Cole
[c20]
6Erik D. Demaine
[c44]
7Thomas W. Doeppner Jr.
[c29]
8David Eisenstat
[c49] [i5]
9Michelangelo Grigni
[c22]
10Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi)
[c48] [c44]
11Lisa Hellerstein
[j3]
12Monika Rauch Henzinger (Monika Henzinger, Monika Rauch)
[j16] [c17]
13Ming-Yang Kao
[j6] [c4]
14David R. Karger
[j24] [i2] [c25] [c22] [j13]
15Ken-ichi Kawarabayashi
[c46] [i7]
16Samir Khuller
[j5]
17Benjamin B. Kimia
[j22] [j20] [c34] [c32] [c31] [c30] [c28]
18Andrew Koyfman
[c29]
19Radha Krishnan
[j23]
20Hsueh-I Lu
[j21] [i1] [c23] [c21] [c19] [c10]
21Dániel Marx
[c50]
22Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu)
[i10] [c49] [c48] [i5] [j26] [c42] [c40] [c39]
23Shay Mozes
[i9] [c47] [c45] [i8] [i6] [j28] [i4] [c43]
24Joseph Naor (Seffi Naor)
[j5]
25Robert H. B. Netzer
[j21] [i1] [c21] [c10]
26Yahav Nussbaum
[c47] [i6]
27Serge A. Plotkin
[j18] [j9] [c12]
28Balaji Raghavachari
[j23] [c9]
29Satish Rao
[j18] [j16] [j14] [c17] [c12] [c5]
30R. Ravi
[j23] [j14] [j12] [j11] [c15] [c14] [c9] [c7] [c6] [c5]
31John H. Reif
[j2] [j1] [c1]
32Sairam Sairam
[c8]
33Thomas B. Sebastian
[j22] [j20] [c34] [c32] [c31] [c30]
34Daniel Sharvit
[c28]
35Christian Sommer
[i9] [c46] [i7]
36Clifford Stein (Cliff Stein)
[j24] [i2] [c25] [j9] [j8] [j4] [c3]
37Sairam Subramanian
[j19] [j17] [j16] [c17] [c16] [c11]
38Éva Tardos
[j18] [j9] [c3]
39Robert Endre Tarjan
[c20] [j13] [c18]
40Mikkel Thorup
[j24] [i2] [c25]
41Srikanta Tirthapura
[c28]
42Oren Weimann
[j28] [c43]
43Robert Wilber
[j3]
44Andrzej Woloszyn
[c22]
45Christian Wulff-Nilsen
[c47] [i6]
46Neal E. Young
[j24] [i3] [i2] [c26] [c25]

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Wed May 22 09:13:33 2013 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page