BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Belgium
1 × Finland
1 × Iceland
1 × Japan
1 × United Kingdom
2 × Canada
22 × USA
Collaborated with:
H.Kaplan D.D.Sleator H.N.Gabow A.V.Goldberg T.Lengauer W.J.Paul L.Georgiadis P.N.Klein R.Sundar C.J.V.Wyk R.Paige R.M.Karp M.R.Brown S.Even D.J.Rose G.S.Brodal G.Lagogiannis E.Molad N.Shafrir W.P.Thurston J.L.Bentley J.R.Gilbert J.Valdes E.L.Lawler J.R.Celoni T.D.Hansen U.Zwick J.R.Driscoll N.Sarnak B.Haeupler T.Kavitha R.Mathew S.Sen M.Blum R.W.Floyd V.R.Pratt R.L.Rivest B.Ghosh F.T.Leighton B.M.Maggs S.Muthukrishnan C.G.Plaxton R.Rajaraman A.W.Richa D.Zuckerman
Talks about:
algorithm (10) time (9) problem (8) linear (8) space (5) tree (5) list (4) represent (3) minimum (3) graph (3)

Person: Robert Endre Tarjan

DBLP DBLP: Tarjan:Robert_Endre

Contributed to:

ICALP (1) 20152015
ICALP (1) 20122012
STOC 20122012
ICALP (1) 20082008
STOC 20032003
STOC 20022002
STOC 19991999
STOC 19961996
STOC 19951995
STOC 19941994
STOC 19901990
STOC 19881988
STOC 19871987
STOC 19861986
ICALP 19841984
STOC 19841984
STOC 19831983
STOC 19811981
POPL 19801980
STOC 19801980
STOC 19791979
STOC 19781978
ICALP 19771977
STOC 19771977
STOC 19761976
STOC 19751975
STOC 19741974
STOC 19731973
STOC 19721972

Wrote 39 papers:

Hollow Heaps (TDH, HK, RET, UZ), pp. 689–700.
ICALP-v1-2012-GeorgiadisT #independence #order
Dominators, Directed Bipolar Orders, and Independent Spanning Trees (LG, RET), pp. 375–386.
STOC-2012-BrodalLT #fibonacci #strict
Strict fibonacci heaps (GSB, GL, RET), pp. 1177–1184.
ICALP-A-2008-HaeuplerKMST #algorithm #incremental #performance
Faster Algorithms for Incremental Topological Ordering (BH, TK, RM, SS, RET), pp. 421–433.
Dynamic rectangular intersection with priorities (HK, EM, RET), pp. 639–648.
Meldable heaps and boolean union-find (HK, NS, RET), pp. 573–582.
STOC-1999-GabowKT #algorithm
Unique Maximum Matching Algorithms (HNG, HK, RET), pp. 70–78.
STOC-1996-KaplanT #functional
Purely Functional Representations of Catenable Sorted Lists (HK, RET), pp. 202–211.
STOC-1995-GhoshLMMPRRTZ #algorithm #analysis
Tight analyses of two local load balancing algorithms (BG, FTL, BMM, SM, CGP, RR, AWR, RET, DZ), pp. 548–558.
STOC-1995-KaplanT #persistent #recursion
Persistent lists with catenation via recursive slow-down (HK, RET), pp. 93–102.
STOC-1994-KleinT #algorithm #linear #random
A randomized linear-time algorithm for finding minimum spanning trees (PNK, RET), pp. 9–15.
STOC-1990-SundarT #sequence #set
Unique Binary Search Tree Representations and Equality-testing of Sets and Sequences (RS, RET), pp. 18–25.
STOC-1988-GabowT #algorithm #problem
Almost-Optimum Speed-ups of Algorithms for Bipartite Matching and Related Problems (HNG, RET), pp. 514–527.
STOC-1988-GoldbergT #low cost
Finding Minimum-Cost Circulations by Canceling Negative Cycles (AVG, RET), pp. 388–397.
STOC-1987-GoldbergT #approximate #low cost #problem
Solving Minimum-Cost Flow Problems by Successive Approximation (AVG, RET), pp. 7–18.
STOC-1986-DriscollSST #data type #persistent
Making Data Structures Persistent (JRD, NS, DDS, RET), pp. 109–121.
STOC-1986-GoldbergT #approach #problem
A New Approach to the Maximum Flow Problem (AVG, RET), pp. 136–146.
STOC-1986-SleatorTT #distance #geometry
Rotation Distance, Triangulations, and Hyperbolic Geometry (DDS, RET, WPT), pp. 122–135.
STOC-1986-TarjanW #algorithm #linear
A Linear-Time Algorithm for Triangulating Simple Polygons (RET, CJVW), pp. 380–388.
ICALP-1984-PaigeT #algorithm #linear #problem
A Linear Time Algorithm to Solve the Single Function Coarsest Partition Problem (RP, RET), pp. 371–379.
STOC-1984-GabowBT #geometry #problem #scalability
Scaling and Related Techniques for Geometry Problems (HNG, JLB, RET), pp. 135–143.
STOC-1984-SleatorT #performance
Amortized Efficiency of List Update Rules (DDS, RET), pp. 488–492.
STOC-1983-GabowT #algorithm #linear #set
A Linear-Time Algorithm for a Special Case of Disjoint Set Union (HNG, RET), pp. 246–251.
STOC-1983-SleatorT #self
Self-Adjusting Binary Trees (DDS, RET), pp. 235–245.
STOC-1981-SleatorT #data type
A Data Structure for Dynamic Trees (DDS, RET), pp. 114–122.
POPL-1980-Tarjan #parsing
Prime Subprogram Parsing of a Program (RET), pp. 95–105.
STOC-1980-KarpT #algorithm #linear #problem
Linear Expected-Time Algorithms for Connectivity Problems (RMK, RET), pp. 368–377.
STOC-1979-GilbertLT #polynomial #problem
The Pebbling Problem is Complete in Polynomial Space (JRG, TL, RET), pp. 237–248.
STOC-1979-LengauerT #bound #trade-off
Upper and Lower Bounds on Time-Space Tradeoffs (TL, RET), pp. 262–277.
STOC-1979-ValdesTL #graph #parallel #recognition
The recognition of Series Parallel digraphs (JV, RET, ELL), pp. 1–12.
STOC-1978-BrownT #linear #representation
A Representation for Linear Lists with Movable Fingers (MRB, RET), pp. 19–29.
ICALP-1977-PaulT #game studies #trade-off
Time-Space Trade-Offs in a Pebble Game (WJP, RET), pp. 365–369.
STOC-1977-Tarjan #maintenance #set
Reference Machines Require Non-linear Time to Maintain Disjoint Sets (RET), pp. 18–29.
STOC-1976-PaulTC #bound #game studies #graph
Space Bounds for a Game of Graphs (WJP, RET, JRC), pp. 149–160.
STOC-1975-EvenT #combinator #polynomial #problem
a Combinatorial Problem which is Complete in Polynomial Space (SE, RET), pp. 66–71.
STOC-1975-RoseT #algorithm #aspect-oriented
Algorithmic Aspects of Vertex Elimination (DJR, RET), pp. 245–254.
STOC-1974-Tarjan #graph #testing
Testing Graph Connectivity (RET), pp. 185–193.
STOC-1973-Tarjan #graph #testing
Testing Flow Graph Reducibility (RET), pp. 96–107.
STOC-1972-BlumFPRT #bound #linear
Linear Time Bounds for Median Computations (MB, RWF, VRP, RLR, RET), pp. 119–124.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.