( en | de | ru )

 

Disambiguation of "Karger, David R."

Author of the publication

copydeleteadd this publication to your clipboard
What Would It Mean to Blog on the Semantic Web?

, and . International Semantic Web Conference, volume 3298 of Lecture Notes in Computer Science, page 214-228. Springer, (2004)

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.

David R Anderson

David R Wenger

David A R Forrester

Reinhard Kärger

Joachim Karger

 

Other publications of authors with the same name

Cascading tree sheets and recombinant HTML: better encapsulation and retargeting of web content., and . WWW, page 107-118. International World Wide Web Conferences Steering Committee / ACM, (2013)Prim-Dijkstra tradeoffs for improved performance-driven routing tree design., , , , and . IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 14 (7): 890-896 (1995)Recursive Random Contraction Revisited., and . CoRR, (2020)Approximating -t Minimum Cuts in Otilde;($^2$) Time, and . STOC, page 47-55. (1996)Haystack: A Customizable General-Purpose Information Management Tool for End Users of Semistructured Data, , , , and . Proceedings of of CIDR 2005, (2005)Implementing a Fully Polynomial Time Approximation Scheme for All Terminal Network Reliability., and . SODA, page 334-343. ACM/SIAM, (1997)"How fancy you are to make us use your fancy tool": Coordinating Individuals' Tool Preference over Group Boundaries., , , and . Proc. ACM Hum. Comput. Interact., 8 (GROUP): 1-31 (2024)Deliberation and Resolution on Wikipedia: A Case Study of Requests for Comments., , , and . Proc. ACM Hum. Comput. Interact., 2 (CSCW): 74:1-74:24 (2018)Minimum cuts in near-linear time.. J. ACM, 47 (1): 46-76 (2000)A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees., , and . J. ACM, 42 (2): 321-328 (1995)