164 citations found. Retrieving documents...
R. E. Tarjan, Data Structures and Network Algorithms, CBMS-NSF Ref. Conf. Ser. Appl. Math., vol. 44, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, 1983.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:

First 50 documents  Next 50

Melding Priority Queues - Mendelson, Tarjan, Thorup, Zwick (2004)   Self-citation (Tarjan)   (Correct)

No context found.

R.E. Tarjan. Data structures and network algorithms. CBMS 44, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.


Nonlinear Approximation - Eisenbud Green Hulek   (Correct)

No context found.

R. E. Tarjan, Data Structures and Network Algorithms, CBMS-NSF Ref. Conf. Ser. Appl. Math., vol. 44, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, 1983.


BEAR-FP: A Robust Framework for Floorplanning - Pedram, Kuh (1992)   (Correct)

No context found.

R. E. Tarjan. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, 1983.


Improved Symmetric Lists - Bachmaier, Raitner (2004)   (2 citations)  (Correct)

No context found.

R. E. Tarjan. Data Structures and Network Algorithms, chapter 1.3, page 11. CBMS-NSF Regional Conferences Series in Applied Mathematics. Society for Industrial and Applied Mathematics, 1983.


Client Assignment in Content Dissemination Networks for - Dynamic Data Shetal (2005)   (Correct)

No context found.

R. Tarjan. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, 1983.


Universidade Federal de Minas Gerais - Instituto De Cincias   (Correct)

No context found.

R.E. Tarjan, Data structures and network algorithms, Society for Industrial and Applied Mathematics, Philadelphia, 1983.


Redundancy, Efficiency and Robustness in - Multi-Robot Coverage Noam   (Correct)

No context found.

R. E. Tarjan. Data structures and network algorithms. Society for Industrial and Applied Mathematics, 1983.


Packing Paths in Digraphs - Brewster, Hell, Pantel, Rizzi, Yeo   (Correct)

No context found.

R. E. Tarjan. Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, 1983. 16


Improved Symmetric Lists - Bachmaier (2004)   (2 citations)  (Correct)

No context found.

R. E. Tarjan. Data Structures and Network Algorithms, chapter 1.3, page 11. CBMS-NSF Regional Conferences Series in Applied Mathematics. Society for Industrial and Applied Mathematics, 1983.


Improved Symmetric Lists - Bachmaier, Raitner (2004)   (2 citations)  (Correct)

No context found.

R. E. Tarjan. Data Structures and Network Algorithms, chapter 1.3, page 11. CBMS-NSF Regional Conferences Series in Applied Mathematics. Society for Industrial and Applied Mathematics, 1983.


On Matching Nodes Between Trees - Zhang (2003)   (Correct)

No context found.

R. E. Tarjan. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, 1983. 14


A Practical Shortest Path Algorithm with Linear Expected Time - Goldberg (2001)   (Correct)

No context found.

R. E. Tarjan. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.


Optimally Cutting a Surface into a Disk - Erickson, Har-Peled (2002)   (7 citations)  (Correct)

No context found.

R. E. Tarjan. Data Structures and Network Algorithms, volume 44 of CBMSNSF Regional Conference Series in Applied Mathematics. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.


Improved Symmetric Lists - Bachmaier, Raitner (2004)   (2 citations)  (Correct)

No context found.

R. E. Tarjan. Data Structures and Network Algorithms, chapter 1.3, page 11. CBMS-NSF Regional Conferences Series in Applied Mathematics. Society for Industrial and Applied Mathematics, 1983.


Computing the Shortest Path: A* Search Meets Graph Theory - Goldberg, Harrelson (2004)   (Correct)

No context found.

R. E. Tarjan. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.


On the Computational Complexity of Dynamic Graph Problems - Ramalingam And Thomas (1996)   (25 citations)  (Correct)

No context found.

Tarjan, R.E., Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA (1983).


Clustering of Bipartite Advertiser-Keyword Graph - John Joseph Carrasco (2003)   (1 citation)  (Correct)

No context found.

R. Tarjan. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, 1983.


On the Stability of Isolated and Interconnected.. - Marsan, Leonardi.. (2004)   (Correct)

No context found.

R.E.Tarjan, Data structures and network algorithms, Society for Industrial and Applied Mathematics, Pennsylvania, Nov.1983.


An Incremental Algorithm for a Generalization of the.. - Ramalingam And Thomas (1992)   (46 citations)  (Correct)

No context found.

Tarjan, R.E., Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA (1983).


Optimal discrete Morse functions for 2-manifolds - Lewiner, Tavares, Lopes (2002)   (Correct)

No context found.

R. Tarjan, Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, 1983. 16


On-the-Fly Maintenance of Series-Parallel.. - Bender, Fineman.. (2004)   (Correct)

No context found.

R. E. Tarjan. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, 1983.


Implementations of Dijkstra's Algorithm Based on.. - Goldberg, Silverstein (1995)   (2 citations)  (Correct)

No context found.

R. E. Tarjan. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.


An Incremental Algorithm for a Generalization of the.. - Ramalingam And Thomas (1992)   (46 citations)  (Correct)

No context found.

Tarjan, R.E., Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA (1983).


Optimal discrete Morse functions for 2-manifolds - Lewiner, Lopes, Tavares (2003)   (Correct)

No context found.

R.E. Tarjan, Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, 1983.


A Simple Shortest Path Algorithm with Linear Average Time - Goldberg   (13 citations)  (Correct)

No context found.

R. E. Tarjan. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC