| 2008 |
|---|
| 76 | EE | Yossi Azar,
Benjamin E. Birnbaum,
Anna R. Karlin,
Claire Mathieu,
C. Thach Nguyen:
Improved Approximation Algorithms for Budgeted Allocations.
ICALP (1) 2008: 186-197 |
| 75 | EE | Matthew Cary,
Abraham D. Flaxman,
Jason D. Hartline,
Anna R. Karlin:
Auctions for structured procurement.
SODA 2008: 304-313 |
| 74 | EE | Ioannis Giotis,
Anna R. Karlin:
On the Equilibria and Efficiency of the GSP Mechanism in Keyword Auctions with Externalities.
WINE 2008: 629-638 |
| 73 | EE | Yossi Azar,
Benjamin E. Birnbaum,
Anna R. Karlin,
C. Thach Nguyen:
Thinking Twice about Second-Price Ad Auctions
CoRR abs/0809.1895: (2008) |
| 2007 |
|---|
| 72 | EE | Anna R. Karlin:
Ad Auctions - Current and Future Research.
AAIM 2007: 425 |
| 71 | EE | Matthew Cary,
Aparna Das,
Benjamin Edelman,
Ioannis Giotis,
Kurtis Heimerl,
Anna R. Karlin,
Claire Mathieu,
Michael Schwarz:
Greedy bidding strategies for keyword auctions.
ACM Conference on Electronic Commerce 2007: 262-271 |
| 70 | EE | Nicole Immorlica,
Anna R. Karlin,
Mohammad Mahdian,
Kunal Talwar:
Balloon Popping With Applications to Ascending Auctions.
FOCS 2007: 104-112 |
| 69 | EE | Ning Chen,
Anna R. Karlin:
Cheap labor can be expensive.
SODA 2007: 707-715 |
| 2005 |
|---|
| 68 | EE | Anna R. Karlin,
David Kempe,
Tami Tamir:
Beyond VCG: Frugality of Truthful Mechanisms.
FOCS 2005: 615-626 |
| 67 | EE | Venkatesan Guruswami,
Jason D. Hartline,
Anna R. Karlin,
David Kempe,
Claire Kenyon,
Frank McSherry:
On profit-maximizing envy-free pricing.
SODA 2005: 1164-1173 |
| 2004 |
|---|
| 66 | EE | Andrew V. Goldberg,
Jason D. Hartline,
Anna R. Karlin,
Michael E. Saks:
A Lower Bound on the Competitive Ratio of Truthful Auctions.
STACS 2004: 644-655 |
| 2003 |
|---|
| 65 | EE | Anna R. Karlin,
Claire Kenyon,
Dana Randall:
Dynamic TCP Acknowledgment and Other Stories about e/(e-1).
Algorithmica 36(3): 209-224 (2003) |
| 2002 |
|---|
| 64 | EE | Anna R. Karlin:
Mechanism Design for Fun and Profit.
ESA 2002: 3 |
| 63 | EE | Kaustubh Deshmukh,
Andrew V. Goldberg,
Jason D. Hartline,
Anna R. Karlin:
Truthful and Competitive Double Auctions.
ESA 2002: 361-373 |
| 62 | EE | Jared Saia,
Amos Fiat,
Steven D. Gribble,
Anna R. Karlin,
Stefan Saroiu:
Dynamically Fault-Tolerant Content Addressable Networks.
IPTPS 2002: 270-279 |
| 61 | EE | Amos Fiat,
Andrew V. Goldberg,
Jason D. Hartline,
Anna R. Karlin:
Competitive generalized auctions.
STOC 2002: 72-81 |
| 60 | EE | Eric J. Anderson,
Thomas E. Anderson,
Steven D. Gribble,
Anna R. Karlin,
Stefan Savage:
A quantitative evaluation of traffic-aware routing strategies.
Computer Communication Review 32(1): 67 (2002) |
| 59 | | Eric J. Anderson,
Kirsten Hildrum,
Anna R. Karlin,
April Rasala,
Michael E. Saks:
On list update and work function algorithms.
Theor. Comput. Sci. 287(2): 393-418 (2002) |
| 2001 |
|---|
| 58 | EE | Anna R. Karlin:
Spectral Analysis for Data Mining.
ALENEX 2001: 188 |
| 57 | EE | Eric J. Anderson,
Joseph Hall,
Jason D. Hartline,
Michael Hobbs,
Anna R. Karlin,
Jared Saia,
Ram Swaminathan,
John Wilkes:
An Experimental Study of Data Migration Algorithms.
Algorithm Engineering 2001: 145-158 |
| 56 | | Dimitris Achlioptas,
Amos Fiat,
Anna R. Karlin,
Frank McSherry:
Web Search via Hub Synthesis.
FOCS 2001: 500-509 |
| 55 | EE | Anna R. Karlin:
Web Search via Hub Synthesis.
RANDOM-APPROX 2001: 6 |
| 54 | EE | Joseph Hall,
Jason D. Hartline,
Anna R. Karlin,
Jared Saia,
John Wilkes:
On algorithms for efficient data migration.
SODA 2001: 620-629 |
| 53 | EE | Anna R. Karlin,
Claire Kenyon,
Dana Randall:
Dynamic TCP acknowledgement and other stories about e/(e-1).
STOC 2001: 502-509 |
| 52 | EE | Yossi Azar,
Amos Fiat,
Anna R. Karlin,
Frank McSherry,
Jared Saia:
Spectral analysis of data.
STOC 2001: 619-626 |
| 51 | EE | Stefan Savage,
David Wetherall,
Anna R. Karlin,
Thomas E. Anderson:
Network support for IP traceback.
IEEE/ACM Trans. Netw. 9(3): 226-237 (2001) |
| 2000 |
|---|
| 50 | EE | Stefan Savage,
David Wetherall,
Anna R. Karlin,
Thomas E. Anderson:
Practical network support for IP traceback.
SIGCOMM 2000: 295-306 |
| 49 | EE | Ronald Fagin,
Anna R. Karlin,
Jon M. Kleinberg,
Prabhakar Raghavan,
Sridhar Rajagopalan,
Ronitt Rubinfeld,
Madhu Sudan,
Andrew Tomkins:
Random walks with ``back buttons'' (extended abstract).
STOC 2000: 484-493 |
| 48 | | Tracy Kimbrel,
Anna R. Karlin:
Near-Optimal Parallel Prefetching and Caching.
SIAM J. Comput. 29(4): 1051-1082 (2000) |
| 47 | EE | Anna R. Karlin,
Steven J. Phillips,
Prabhakar Raghavan:
Markov Paging.
SIAM J. Comput. 30(3): 906-922 (2000) |
| 1999 |
|---|
| 46 | EE | Eric J. Anderson,
Kirsten Hildrum,
Anna R. Karlin,
April Rasala,
Michael E. Saks:
On List Update and Work Function Algorithms.
ESA 1999: 289-300 |
| 45 | EE | Peter van Vleet,
Eric J. Anderson,
Lindsay Brown,
Jean-Loup Baer,
Anna R. Karlin:
Pursuing the Performance Potential of Dynamic Cache Line Sizes.
ICCD 1999: 528-537 |
| 44 | EE | Gretta Bartels,
Anna R. Karlin,
Darrell C. Anderson,
Jeffrey S. Chase,
Henry M. Levy,
Geoffrey M. Voelker:
Potentials and Limitations of Fault-Based Markov Prefetching for Virtual Memory Pages.
SIGMETRICS 1999: 206-207 |
| 43 | EE | Alec Wolman,
Geoffrey M. Voelker,
Nitin Sharma,
Neal Cardwell,
Anna R. Karlin,
Henry M. Levy:
On the scale and performance of cooperative Web proxy caching.
SOSP 1999: 16-31 |
| 42 | EE | Alec Wolman,
Geoffrey M. Voelker,
Nitin Sharma,
Neal Cardwell,
Molly Brown,
Tashana Landray,
Denise Pinnel,
Anna R. Karlin,
Henry M. Levy:
Organization-Based Analysis of Web-Object Sharing and Caching.
USENIX Symposium on Internet Technologies and Systems 1999 |
| 41 | | Amir Ben-Dor,
Anna R. Karlin,
Nathan Linial,
Yuri Rabinovich:
A Note on the Influence of an epsilon-Biased Random Source.
J. Comput. Syst. Sci. 58(1): 174-176 (1999) |
| 40 | | Yossi Azar,
Andrei Z. Broder,
Anna R. Karlin,
Eli Upfal:
Balanced Allocations.
SIAM J. Comput. 29(1): 180-200 (1999) |
| 1998 |
|---|
| 39 | EE | Geoffrey M. Voelker,
Eric J. Anderson,
Tracy Kimbrel,
Michael J. Feeley,
Jeffrey S. Chase,
Anna R. Karlin,
Henry M. Levy:
Implementing Cooperative Prefetching and Caching in a Globally-Managed Memory System.
SIGMETRICS 1998: 33-43 |
| 1996 |
|---|
| 38 | | Hervé A. Jamrozik,
Michael J. Feeley,
Geoffrey M. Voelker,
James Evans II,
Anna R. Karlin,
Henry M. Levy,
Mary K. Vernon:
Reducing Network Latency Using Subpages in a Global Memory Environment.
ASPLOS 1996: 258-267 |
| 37 | | Tracy Kimbrel,
Anna R. Karlin:
Near-Optimal Parallel Prefetching and Caching.
FOCS 1996: 540-549 |
| 36 | EE | Craig Anderson,
Anna R. Karlin:
Two Adaptive Hybrid Cache Coherency Protocols.
HPCA 1996: 303-313 |
| 35 | | Tracy Kimbrel,
Andrew Tomkins,
R. Hugo Patterson,
Brian N. Bershad,
Pei Cao,
Edward W. Felten,
Garth A. Gibson,
Anna R. Karlin,
Kai Li:
A Trace-Driven Comparison of Algorithms for Parallel Prefetching and Caching.
OSDI 1996: 19-34 |
| 34 | | Anna R. Karlin:
On the Performance of Competitive Algorithms in Practice.
Online Algorithms 1996: 373-384 |
| 33 | | Tracy Kimbrel,
Pei Cao,
Edward W. Felten,
Anna R. Karlin,
Kai Li:
Integrating Parallel Prefetching and Caching.
SIGMETRICS 1996: 262-263 |
| 32 | EE | Pei Cao,
Edward W. Felten,
Anna R. Karlin,
Kai Li:
Implementation and Performance of Integrated Application-Controlled File Caching, Prefetching, and Disk Scheduling.
ACM Trans. Comput. Syst. 14(4): 311-343 (1996) |
| 31 | | Yossi Azar,
Andrei Z. Broder,
Anna R. Karlin,
Nathan Linial,
Steven Phillips:
Biased Random Walks.
Combinatorica 16(1): 1-18 (1996) |
| 30 | | Sandy Irani,
Anna R. Karlin,
Steven Phillips:
Strongly Competitive Algorithms for Paging with Locality of Reference.
SIAM J. Comput. 25(3): 477-497 (1996) |
| 1995 |
|---|
| 29 | EE | Theodore H. Romer,
Wayne H. Ohlrich,
Anna R. Karlin,
Brian N. Bershad:
Reducing TLB and Memory Overhead Using Online Superpage Promotion.
ISCA 1995: 176-187 |
| 28 | | Pei Cao,
Edward W. Felten,
Anna R. Karlin,
Kai Li:
A Study of Integrated Prefetching and Caching Strategies.
SIGMETRICS 1995: 188-197 |
| 27 | | Michael J. Feeley,
William E. Morgan,
Frederic H. Pighin,
Anna R. Karlin,
Henry M. Levy,
Chandramohan A. Thekkath:
Implementing Global Memory Management in a Workstation Cluster.
SOSP 1995: 201-212 |
| 26 | EE | Amos Fiat,
Anna R. Karlin:
Randomized and multipointer paging with locality of reference.
STOC 1995: 626-634 |
| 1994 |
|---|
| 25 | EE | Anna R. Karlin,
Greg Nelson,
Hisao Tamaki:
On the fault tolerance of the butterfly.
STOC 1994: 125-133 |
| 24 | EE | Yossi Azar,
Andrei Z. Broder,
Anna R. Karlin,
Eli Upfal:
Balanced allocations (extended abstract).
STOC 1994: 593-602 |
| 23 | | Anna R. Karlin,
Mark S. Manasse,
Lyle A. McGeoch,
Susan S. Owicki:
Competitive Randomized Algorithms for Nonuniform Problems.
Algorithmica 11(6): 542-571 (1994) |
| 22 | EE | Hendrik A. Goosen,
Anna R. Karlin,
David R. Cheriton,
Dieter Polzin:
Chiron parallel program performance visualization system.
Computer-Aided Design 26(12): 899-906 (1994) |
| 21 | | Andrei Z. Broder,
Anna R. Karlin,
Prabhakar Raghavan,
Eli Upfal:
Trading Space for Time in Undirected s-t Connectivity.
SIAM J. Comput. 23(2): 324-334 (1994) |
| 20 | | Martin Dietzfelbinger,
Anna R. Karlin,
Kurt Mehlhorn,
Friedhelm Meyer auf der Heide,
Hans Rohnert,
Robert Endre Tarjan:
Dynamic Perfect Hashing: Upper and Lower Bounds.
SIAM J. Comput. 23(4): 738-761 (1994) |
| 19 | | Yossi Azar,
Andrei Z. Broder,
Anna R. Karlin:
On-Line Load Balancing.
Theor. Comput. Sci. 130(1): 73-84 (1994) |
| 1992 |
|---|
| 18 | | Anna R. Karlin,
Steven J. Phillips,
Prabhakar Raghavan:
Markov Paging (Extended Abstract)
FOCS 1992: 208-217 |
| 17 | | Yossi Azar,
Andrei Z. Broder,
Anna R. Karlin:
On-line Load Balancing (Extended Abstract)
FOCS 1992: 218-225 |
| 16 | | Susan S. Owicki,
Anna R. Karlin:
Factors in the Performance of the AN1 Computer Network.
SIGMETRICS 1992: 167-180 |
| 15 | EE | Sandy Irani,
Anna R. Karlin,
Steven Phillips:
Strongly Competitive Algorithms for Paging with Locality of Reference.
SODA 1992: 228-236 |
| 14 | | Yossi Azar,
Andrei Z. Broder,
Anna R. Karlin,
Nathan Linial,
Steven Phillips:
Biased Random Walks
STOC 1992: 1-9 |
| 1991 |
|---|
| 13 | | Andrei Z. Broder,
Anna R. Karlin,
Prabhakar Raghavan,
Eli Upfal:
On the Parallel Complexity of Evaluating Game Trees.
SODA 1991: 404-413 |
| 12 | | Anna R. Karlin,
Kai Li,
Mark S. Manasse,
Susan S. Owicki:
Empirical Studies of Competitive Spinning for a Shared-Memory Multiprocessor.
SOSP 1991: 41-55 |
| 1990 |
|---|
| 11 | | Christos Kaklamanis,
Anna R. Karlin,
Frank Thomson Leighton,
Victor Milenkovic,
Prabhakar Raghavan,
Satish Rao,
Clark D. Thomborson,
A. Tsantilas:
Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract)
FOCS 1990: 285-296 |
| 10 | | Anna R. Karlin,
Mark S. Manasse,
Lyle A. McGeoch,
Susan S. Owicki:
Competitive Randomized Algorithms for Non-Uniform Problems.
SODA 1990: 301-309 |
| 9 | | Andrei Z. Broder,
Anna R. Karlin:
Multilevel Adaptive Hashing.
SODA 1990: 43-53 |
| 1989 |
|---|
| 8 | | Andrei Z. Broder,
Anna R. Karlin,
Prabhakar Raghavan,
Eli Upfal:
Trading Space for Time in Undirected s-t Connectivity
STOC 1989: 543-549 |
| 1988 |
|---|
| 7 | | Andrei Z. Broder,
Anna R. Karlin:
Bounds on the Cover Time (Preliminary Version)
FOCS 1988: 479-487 |
| 6 | | Martin Dietzfelbinger,
Anna R. Karlin,
Kurt Mehlhorn,
Friedhelm Meyer auf der Heide,
Hans Rohnert,
Robert Endre Tarjan:
Dynamic Perfect Hashing: Upper and Lower Bounds
FOCS 1988: 524-531 |
| 5 | | Anna R. Karlin,
Mark S. Manasse,
Larry Rudolph,
Daniel Dominic Sleator:
Competitive Snoopy Caching.
Algorithmica 3: 77-119 (1988) |
| 4 | EE | Anna R. Karlin,
Eli Upfal:
Parallel hashing: an efficient implementation of shared memory.
J. ACM 35(4): 876-892 (1988) |
| 1987 |
|---|
| 3 | | Anna R. Karlin,
Howard Trickey,
Jeffrey D. Ullman:
Algorithms for the Compilation of Regular Expressions into PLAs.
Algorithmica 2: 283-314 (1987) |
| 1986 |
|---|
| 2 | | Anna R. Karlin,
Mark S. Manasse,
Larry Rudolph,
Daniel Dominic Sleator:
Competitive Snoopy Caching
FOCS 1986: 244-254 |
| 1 | | Anna R. Karlin,
Eli Upfal:
Parallel Hashing-An Efficient Implementation of Shared Memory (Preliminary Version)
STOC 1986: 160-168 |
