Robert Endre Tarjan. Data structures and network algorithms, volume 44 of CBMS-NSF Reg. Conf. Ser. Appl. Math. SIAM, 1983.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Accurate Power Estimation Using Circuit Partitioning - Ana Freitas Atf (Correct)
No context found.
Robert Endre Tarjan. Data structures and network algorithms, volume 44 of CBMS-NSF Reg. Conf. Ser. Appl. Math. SIAM, 1983.
What Are the Samples for Learning Efficient Routing Heuristics? - Schönfeld, Molitor (1999) (Correct)
No context found.
R.E. Tarjan. Data structures and network algorithms, volume 44 of CBMS-NSF Reg. Conf. Ser. Appl. Math. SIAM, 1983.
Lower Bounds For Parallel Algorithms - Shah (2001) (Correct)
No context found.
Robert E. Tarjan. Data structures and network algorithms, volume 44 of CBMS-NSF Reg. Conf. Ser. Appl. Math. SIAM, 1983.
A Lower Bound on Computing Blocking Flows in Graphs - Mulmuley (Correct)
No context found.
Robert E. Tarjan. Data structures and network algorithms, volume 44 of CBMS-NSF Reg. Conf. Ser. Appl. Math. SIAM, 1983.
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