( en | de | ru )

 

Disambiguation of "Karlin, Anna R."

Author of the publication

copydeleteadd this publication to your clipboard
Biased Random Walks

, , , , and . STOC, page 1-9. ACM, (1992)

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.

Dieter Karlin

David Karlin

Klaus Karlin

Heike Anna Brücker

Dirk Annacker

 

Other publications of authors with the same name

A Lower Bound on the Competitive Ratio of Truthful Auctions., , , and . STACS, volume 2996 of Lecture Notes in Computer Science, page 644-655. Springer, (2004)On List Update and Work Function Algorithms., , , , and . ESA, volume 1643 of Lecture Notes in Computer Science, page 289-300. Springer, (1999)Approaching utopia: strong truthfulness and externality-resistant mechanisms., , , and . ITCS, page 221-230. ACM, (2013)Balanced Allocations., , , and . SIAM J. Comput., 29 (1): 180-200 (1999)Matroid Partition Property and the Secretary Problem., , , and . CoRR, (2021)Competitive Snoopy Caching, , , and . FOCS, page 244-254. IEEE Computer Society, (1986)On-line Load Balancing (Extended Abstract), , and . FOCS, page 218-225. IEEE Computer Society, (1992)Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract), , , , , , , and . FOCS, page 285-296. IEEE Computer Society, (1990)Web Search via Hub Synthesis., , , and . FOCS, page 500-509. IEEE Computer Society, (2001)Matroid Partition Property and the Secretary Problem., , , and . ITCS, volume 251 of LIPIcs, page 2:1-2:9. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)