( en | de | ru )

 

Disambiguation of "Karger, David R."

Author of the publication

copydeleteadd this publication to your clipboard
#Confused and beyond: detecting confusion in course forums using students' hashtags.

, , , , , , , and . LAK, page 589-594. ACM, (2020)The conference was reorganized to a virtual event due to the international COVID-19 health crisis..

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

Thomas Karger

Reinhard Kärger

 

Other publications of authors with the same name

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)Approximating -t Minimum Cuts in Otilde;($^2$) Time, and . STOC, page 47-55. (1996)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)Scheduling Algorithms., , and . Algorithms and Theory of Computation Handbook, CRC Press, (1999)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)"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)Random Sampling in Cut, Flow, and Network Design Problems.. Math. Oper. Res., 24 (2): 383-413 (1999)