Robert E. Tarjan. Fast algorithms for solving path problems. Journal of the ACM, 28:594--614, 1981. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Notes on Graph Algorithms Used in Optimizing Compilers - Offner (1995) (2 citations) (Correct)
Data-Flow Frameworks for Worst-Case Execution Time Analysis - Blieberger (2000) (Correct)
A Study Of Side-Effect Analyses For Java - Razafimahefa (1999) (6 citations) (Correct)
Periodic Sets of Integers - Matos (Correct)
Data Flow Analysis Frameworks for Concurrent Programs - Dwyer (1995) (1 citation) (Correct)
A Java Bytecode Optimizer Using Side-effect Analysis - Clausen (1997) (11 citations) (Correct)
Efficient Flow-Sensitive Interprocedural Computation of.. - Choi, Burke, Carini (1993) (75 citations) (Correct)
Efficient Building and Placing of Gating Functions - Tu, Padua (1995) (5 citations) (Correct)
Automatic Array Privatization And Demand-Driven Symbolic Analysis - Tu (1995) (41 citations) (Correct)
DJ-graphs and their application to flow graph analyses - Sreedhar, Lee, Gao (1994) (2 citations) (Correct)
Data Flow Analysis Frameworks for Concurrent Programs (Extended.. - Dwyer (1995) (1 citation) (Correct)
Scalable, Precise Context-Sensitive Top-Down Process for - Modular Points-To Analysis (Correct)
Interprocedural Dataflow Analysis - Alias Analysis - Sathyanathan (2001) (1 citation) (Correct)
Efficient Building and Placing of Gating Functions - Peng Tu And (1995) (5 citations) (Correct)
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