( en | de | ru )

 

Disambiguation of "Tarjan, Robert Endre"

Author of the publication

copydeleteadd this publication to your clipboard
Efficiency of a Good But Not Linear Set Union Algorithm.

. J. ACM, 22 (2): 215-225 (1975)

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.

Endre Komlos

Endre Palatinus

Endre Mészáros

Endre Bangerter

Endre Hagenthurn

 

Other publications of authors with the same name

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)Time-Space Trade-Offs in a Pebble Game., and . ICALP, volume 52 of Lecture Notes in Computer Science, page 365-369. Springer, (1977)Dominators, Directed Bipolar Orders, and Independent Spanning Trees., and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 375-386. Springer, (2012)Minimum Cost Flows in Graphs with Unit Capacities., , , and . STACS, volume 30 of LIPIcs, page 406-419. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Deletion Without Rebalancing in Balanced Binary Trees., and . SODA, page 1490-1499. SIAM, (2010)Self-adjusting top trees., and . SODA, page 813-822. SIAM, (2005)If Piracy Is the Problem, Is DRM the Answer?, , , , and . Digital Rights Management, volume 2770 of Lecture Notes in Computer Science, Springer, (2003)