( en | de | ru )

 

Disambiguation of "Tarjan, Robert Endre"

Author of the publication

copydeleteadd this publication to your clipboard
Shortest Path Feasibility Algorithms: An Experimental Evaluation.

, , , , and . ALENEX, page 118-132. SIAM, (2008)

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 Hagenthurn

Endre Bangerter

 

Other publications of authors with the same name

A Hierarchical Clustering Algorithm Using Strong Components.. Inf. Process. Lett., 14 (1): 26-29 (1982)Unique Binary-Search-Tree Representations and Equality Testing of Sets and Sequences., and . SIAM J. Comput., 23 (1): 24-44 (1994)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)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)Algorithmic Aspects of Vertex Elimination, and . STOC, page 245-254. ACM, (1975)A Data Structure for Dynamic Trees, and . STOC, page 114-122. ACM, (1981)Finding Minimum Spanning Forests in Logarithmic Time and Linear Work Using Random Sampling., , and . SPAA, page 243-250. ACM, (1996)Results and Problems on Self-adjusting Search Trees and Related Data Structures.. SWAT, volume 4059 of Lecture Notes in Computer Science, page 2. Springer, (2006)