( en | de | ru )

 

Disambiguation of "Tarjan, Robert"

Author of the publication

copydeleteadd this publication to your clipboard
Algorithm 447: efficient algorithms for graph manipulation

, and . Communications of the ACM, 16 (6): 372--378 (Jun 1, 1973)
DOI: 10.1145/362248.362272

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Robert Klöfkorn

Numerics for evolution equations: a general interface based design concept. Uni Freiburg, (2009)

Robert Wille

Towards a design flow for reversible logic. Uni Bremen, (2009)

Robert Braun

Referenzmodellierung: Grundlegung und Evaluation der Technik des Modell-Konfigurationsmanagements. TU Dresden, (2010)

Robert Wagner

Inkrementelle Modellsynchronisation. Uni Paderborn, (2009)

Robert Zangenfeind

Das Bedeutung-Text-Modell: Wörterbuch und Grammatik einer integralen Sprachbeschreibung. Uni München, (2009)
 

Other publications of authors with the same name

Algorithm 447: efficient algorithms for graph manipulation, and . Communications of the ACM, 16 (6): 372--378 (Jun 1, 1973)A Hierarchical Clustering Algorithm Using Strong Components.. Inf. Process. Lett., 14 (1): 26-29 (1982)Self-adjusting top trees., and . SODA, page 813-822. SIAM, (2005)Unique Binary-Search-Tree Representations and Equality Testing of Sets and Sequences., and . SIAM J. Comput., 23 (1): 24-44 (1994)If Piracy Is the Problem, Is DRM the Answer?, , , , and . Digital Rights Management, volume 2770 of Lecture Notes in Computer Science, Springer, (2003)Zip Trees, , and . (2018)cite arxiv:1806.06726Comment: 16 pages, 1 figure, 5 algorithms.Confluently Persistent Deques via Data Structural Bootstrapping., and . SODA, page 155-164. ACM/SIAM, (1993)Computing Minimal Spanning Subgraphs in Linear Time., , , and . SODA, page 146-156. ACM/SIAM, (1992)Finding Minimum Spanning Forests in Logarithmic Time and Linear Work Using Random Sampling., , and . SPAA, page 243-250. ACM, (1996)A Data Structure for Dynamic Trees, and . STOC, page 114-122. ACM, (1981)