( en | de | ru )

 

Disambiguation of "Tarjan, Robert Endre"

Author of the publication

copydeleteadd this publication to your clipboard
Clustering Social Networks.

, , , and . WAW, volume 4863 of Lecture Notes in Computer Science, page 56-67. Springer, (2007)

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

Finding Minimum Spanning Forests in Logarithmic Time and Linear Work Using Random Sampling., , and . SPAA, page 243-250. ACM, (1996)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)Sorting Jordan sequences in linear time., , , and . SCG, page 196-203. ACM, (1985)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)A Hierarchical Clustering Algorithm Using Strong Components.. Inf. Process. Lett., 14 (1): 26-29 (1982)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)