A. Borodin. Structured vs. general models in computational complexity. L'Enseignement Math'ematique, XXVIII(3-4):171--190, July-Dec. 1982. Also in [27, pages 47--65]. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Time-Space Trade-Offs For Undirected ST-Connectivity on a JAG - On (Correct)
Tight Lower Bounds for st-Connectivity on the NNJAG Model - Edmonds, Poon, Achlioptas (1999) (1 citation) (Correct)
Time-Space Lower Bounds for Undirected and Directed.. - Edmonds (1993) (2 citations) (Correct)
Time-Space Lower Bounds for Directed s-t Connectivity on JAG.. - Barnes, Edmonds (1993) (9 citations) (Correct)
A Compendium of Problems Complete for P - Greenlaw, Hoover, Ruzzo (1991) (14 citations) (Correct)
A Compendium of Problems Complete for P - Greenlaw, Hoover, Ruzzo (1991) (14 citations) (Correct)
A Time-Space Tradeoff for Undirected Graph.. - Beame, Borodin.. (1997) (5 citations) Self-citation (Borodin) (Correct)
Time-Space Tradeoffs for Undirected Graph.. - Beame, Borodin.. (1997) (5 citations) Self-citation (Borodin) (Correct)
Time-Space Tradeoffs for Undirected Graph Traversal - Beame, Borodin, Raghavan.. (1993) (5 citations) Self-citation (Borodin) (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