![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Anna R. Karlin
- > Startseite > Persons
Person information
- affiliation: University of Washington, School of Computer Science and Engineering, Seattle, WA, USA
- affiliation (PhD 1987): Stanford University, Department of Computer Science, Stanford, CA, USA
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j25]Alon Eden
, Michal Feldman
, Amos Fiat
, Kira Goldner
, Anna R. Karlin:
Combinatorial Auctions with Interdependent Valuations: SOS to the Rescue. Math. Oper. Res. 49(2): 653-674 (2024) - [c84]Niv Buchbinder, Anupam Gupta, Daniel Hathcock, Anna R. Karlin, Sherry Sarkar:
Maintaining Matroid Intersections Online. SODA 2024: 4283-4304 - 2023
- [c83]Anna R. Karlin:
A (Slightly) Improved Approximation Algorithm for the Metric Traveling Salesperson Problem (Invited Talk). ICALP 2023: 1:1-1:1 - [c82]Dorna Abdolazimi, Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan:
Matroid Partition Property and the Secretary Problem. ITCS 2023: 2:1-2:9 - [c81]Anna R. Karlin, Nathan Klein
, Shayan Oveis Gharan:
A Deterministic Better-than-3/2 Approximation Algorithm for Metric TSP. IPCO 2023: 261-274 - [i18]Niv Buchbinder, Anupam Gupta, Daniel Hathcock, Anna R. Karlin, Sherry Sarkar:
Maintaining Matroid Intersections Online. CoRR abs/2309.10214 (2023) - 2022
- [j24]Shuchi Chawla, Nikhil R. Devanur, Anna R. Karlin, Balasubramanian Sivan:
Simple pricing schemes for consumers with evolving values. Games Econ. Behav. 134: 344-360 (2022) - [c80]Anna R. Karlin, Nathan Klein
, Shayan Oveis Gharan:
A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSP. FOCS 2022: 832-843 - [c79]Anna R. Karlin, Nathan Klein
, Shayan Oveis Gharan, Xinzhi Zhang:
An improved approximation algorithm for the minimum k-edge connected multi-subgraph problem. STOC 2022: 1612-1620 - [i17]Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan:
A (Slightly) Improved Deterministic Approximation Algorithm for Metric TSP. CoRR abs/2212.06296 (2022) - 2021
- [c78]Anna R. Karlin, Nathan Klein
, Shayan Oveis Gharan:
A (slightly) improved approximation algorithm for metric TSP. STOC 2021: 32-45 - [i16]Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan, Xinzhi Zhang:
An Improved Approximation Algorithm for the Minimum k-Edge Connected Multi-Subgraph Problem. CoRR abs/2101.05921 (2021) - [i15]Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan:
A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSP. CoRR abs/2105.10043 (2021) - [i14]Dorna Abdolazimi, Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan:
Matroid Partition Property and the Secretary Problem. CoRR abs/2111.12436 (2021) - 2020
- [c77]Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan:
An improved approximation algorithm for TSP in the half integral case. STOC 2020: 28-39 - [c76]Aditya Saraf, Anna R. Karlin, Jamie Morgenstern:
Competition Alleviates Present Bias in Task Completion. WINE 2020: 266-279 - [p1]Anna R. Karlin, Elias Koutsoupias:
Beyond Competitive Analysis. Beyond the Worst-Case Analysis of Algorithms 2020: 529-546 - [i13]Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan:
A (Slightly) Improved Approximation Algorithm for Metric TSP. CoRR abs/2007.01409 (2020) - [i12]Aditya Saraf, Anna R. Karlin, Jamie Morgenstern:
Competition Alleviates Present Bias in Task Completion. CoRR abs/2009.13741 (2020) - [i11]Shuchi Chawla, Kira Goldner, Anna R. Karlin, J. Benjamin Miller:
Non-Adaptive Matroid Prophet Inequalities. CoRR abs/2011.09406 (2020)
2010 – 2019
- 2019
- [c75]Alon Eden, Michal Feldman, Amos Fiat, Kira Goldner
, Anna R. Karlin:
Combinatorial Auctions with Interdependent Valuations: SOS to the Rescue. EC 2019: 19-20 - [c74]Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Christos H. Papadimitriou:
Energy Equilibria in Proof-of-Work Mining. EC 2019: 489-502 - [e2]Anna R. Karlin, Nicole Immorlica, Ramesh Johari:
Proceedings of the 2019 ACM Conference on Economics and Computation, EC 2019, Phoenix, AZ, USA, June 24-28, 2019. ACM 2019, ISBN 978-1-4503-6792-9 [contents] - [i10]Alon Eden, Michal Feldman, Amos Fiat, Kira Goldner, Anna R. Karlin:
Combinatorial Auctions with Interdependent Valuations: SOS to the Rescue. CoRR abs/1903.08384 (2019) - [i9]Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan:
An Improved Approximation Algorithm for TSP in the Half Integral Case. CoRR abs/1908.00227 (2019) - 2018
- [c73]Anna R. Karlin, Shayan Oveis Gharan, Robbie Weber
:
A simply exponential upper bound on the maximum number of stable matchings. STOC 2018: 920-925 - [e1]Anna R. Karlin:
9th Innovations in Theoretical Computer Science Conference, ITCS 2018, January 11-14, 2018, Cambridge, MA, USA. LIPIcs 94, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-060-6 [contents] - 2017
- [c72]Shuchi Chawla, Nikhil R. Devanur, Alexander E. Holroyd, Anna R. Karlin, James B. Martin, Balasubramanian Sivan:
Stability of service under time-of-use pricing. STOC 2017: 184-197 - [i8]Shuchi Chawla, Nikhil R. Devanur, Alexander E. Holroyd, Anna R. Karlin, James B. Martin, Balasubramanian Sivan:
Stability of Service under Time-of-Use Pricing. CoRR abs/1704.02364 (2017) - [i7]Anna R. Karlin, Shayan Oveis Gharan, Robbie Weber:
A Simply Exponential Upper Bound on the Maximum Number of Stable Matchings. CoRR abs/1711.01032 (2017) - 2016
- [c71]Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Claire Mathieu, Rotem Zach:
Carpooling in Social Networks. ICALP 2016: 43:1-43:13 - [c70]Amos Fiat, Kira Goldner
, Anna R. Karlin, Elias Koutsoupias:
The FedEx Problem. EC 2016: 21-22 - [c69]Shuchi Chawla, Nikhil R. Devanur, Anna R. Karlin, Balasubramanian Sivan:
Simple Pricing Schemes For Consumers With Evolving Values. SODA 2016: 1476-1490 - [c68]Kira Goldner, Anna R. Karlin:
A Prior-Independent Revenue-Maximizing Auction for Multiple Additive Bidders. WINE 2016: 160-173 - 2015
- [c67]Anna R. Karlin, Eric Lei:
On a Competitive Secretary Problem. AAAI 2015: 944-950 - 2014
- [j23]Matthew Cary, Aparna Das, Benjamin Edelman, Ioannis Giotis, Kurtis Heimerl, Anna R. Karlin, Scott Duke Kominers
, Claire Mathieu, Michael Schwarz:
Convergence of Position Auctions under Myopic Best-Response Dynamics. ACM Trans. Economics and Comput. 2(3): 9:1-9:20 (2014) - [c66]Shuchi Chawla, Hu Fu, Anna R. Karlin:
Approximate revenue maximization in interdependent value settings. EC 2014: 277-294 - [i6]Shuchi Chawla, Hu Fu, Anna R. Karlin:
Approximate Revenue Maximization in Interdependent Value Settings. CoRR abs/1408.4424 (2014) - [i5]Shuchi Chawla, Nikhil R. Devanur, Anna R. Karlin, Balasubramanian Sivan:
How to sell an app: pay-per-play or buy-it-now? CoRR abs/1411.1381 (2014) - 2013
- [j22]Anna R. Karlin, C. Thach Nguyen, Yuval Peres:
Selling in Exclusive Markets: Some Observations on Prior-Free Mechanism Design. ACM Trans. Economics and Comput. 1(2): 7:1-7:31 (2013) - [c65]Benjamin E. Birnbaum, Gaetano Borriello, Abraham D. Flaxman, Brian DeRenzi, Anna R. Karlin:
Using behavioral data to identify interviewer fabrication in surveys. CHI 2013: 2911-2920 - [c64]L. Elisa Celis, Dimitrios C. Gklezakos, Anna R. Karlin:
On Revenue Maximization for Agents with Costly Information Acquisition - Extended Abstract. ICALP (2) 2013: 484-495 - [c63]Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Angelina Vidali
:
Approaching utopia: strong truthfulness and externality-resistant mechanisms. ITCS 2013: 221-230 - 2012
- [c62]L. Elisa Celis, Anna R. Karlin, Kevin Leyton-Brown, C. Thach Nguyen, David R. M. Thompson:
Approximately Revenue-Maximizing Auctions for Deliberative Agents. AAAI 2012: 1313-1318 - [c61]Alexander Jaffe, Alex Miller, Erik Andersen, Yun-En Liu, Anna R. Karlin, Zoran Popovic:
Evaluating Competitive Game Balance with Restricted Play. AIIDE 2012 - [i4]Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Angelina Vidali:
Approaching Utopia: Strong Truthfulness and Externality-Resistant Mechanisms. CoRR abs/1208.3939 (2012) - 2011
- [c60]Anna R. Karlin, Claire Mathieu, C. Thach Nguyen:
Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack. IPCO 2011: 301-314 - [c59]Nikhil R. Devanur, Jason D. Hartline, Anna R. Karlin, C. Thach Nguyen:
Prior-Independent Multi-parameter Mechanism Design. WINE 2011: 122-133 - 2010
- [j21]Eric Anderson, Joseph Hall, Jason D. Hartline, M. Hobbes, Anna R. Karlin, Jared Saia, Ram Swaminathan, John Wilkes:
Algorithms for Data Migration. Algorithmica 57(2): 349-380 (2010) - [i3]Anna R. Karlin, Claire Mathieu, C. Thach Nguyen:
Integrality Gaps of Linear and Semi-definite Programming Relaxations for Knapsack. CoRR abs/1007.1283 (2010)
2000 – 2009
- 2009
- [c58]Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, C. Thach Nguyen:
On Revenue Maximization in Second-Price Ad Auctions. ESA 2009: 155-166 - [c57]Ning Chen, Nicole Immorlica, Anna R. Karlin, Mohammad Mahdian, Atri Rudra:
Approximating Matches Made in Heaven. ICALP (1) 2009: 266-278 - [i2]Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, C. Thach Nguyen:
On Revenue Maximization in Second-Price Ad Auctions. CoRR abs/0908.2834 (2009) - 2008
- [c56]Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, Claire Mathieu, C. Thach Nguyen:
Improved Approximation Algorithms for Budgeted Allocations. ICALP (1) 2008: 186-197 - [c55]Matthew Cary, Abraham D. Flaxman, Jason D. Hartline, Anna R. Karlin:
Auctions for structured procurement. SODA 2008: 304-313 - [c54]Ioannis Giotis, Anna R. Karlin:
On the Equilibria and Efficiency of the GSP Mechanism in Keyword Auctions with Externalities. WINE 2008: 629-638 - [i1]Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, C. Thach Nguyen:
Thinking Twice about Second-Price Ad Auctions. CoRR abs/0809.1895 (2008) - 2007
- [c53]Anna R. Karlin:
Ad Auctions - Current and Future Research. AAIM 2007: 425 - [c52]Nicole Immorlica, Anna R. Karlin, Mohammad Mahdian, Kunal Talwar:
Balloon Popping With Applications to Ascending Auctions. FOCS 2007: 104-112 - [c51]Matthew Cary, Aparna Das, Benjamin Edelman, Ioannis Giotis, Kurtis Heimerl, Anna R. Karlin, Claire Mathieu, Michael Schwarz:
Greedy bidding strategies for keyword auctions. EC 2007: 262-271 - [c50]Ning Chen, Anna R. Karlin:
Cheap labor can be expensive. SODA 2007: 707-715 - 2006
- [j20]Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin, Michael E. Saks, Andrew Wright:
Competitive auctions. Games Econ. Behav. 55(2): 242-269 (2006) - 2005
- [c49]Anna R. Karlin, David Kempe, Tami Tamir:
Beyond VCG: Frugality of Truthful Mechanisms. FOCS 2005: 615-626 - [c48]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
- [c47]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
- [j19]Anna R. Karlin, Claire Kenyon, Dana Randall:
Dynamic TCP Acknowledgment and Other Stories about e/(e-1). Algorithmica 36(3): 209-224 (2003) - 2002
- [j18]Eric J. Anderson, Thomas E. Anderson, Steven D. Gribble
, Anna R. Karlin, Stefan Savage:
A quantitative evaluation of traffic-aware routing strategies. Comput. Commun. Rev. 32(1): 67 (2002) - [j17]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) - [c46]Anna R. Karlin:
Mechanism Design for Fun and Profit. ESA 2002: 3 - [c45]Kaustubh Deshmukh, Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin:
Truthful and Competitive Double Auctions. ESA 2002: 361-373 - [c44]Jared Saia, Amos Fiat, Steven D. Gribble, Anna R. Karlin, Stefan Saroiu:
Dynamically Fault-Tolerant Content Addressable Networks. IPTPS 2002: 270-279 - [c43]Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin:
Competitive generalized auctions. STOC 2002: 72-81 - 2001
- [j16]Stefan Savage, David Wetherall, Anna R. Karlin, Thomas E. Anderson:
Network support for IP traceback. IEEE/ACM Trans. Netw. 9(3): 226-237 (2001) - [c42]Anna R. Karlin:
Spectral Analysis for Data Mining. ALENEX 2001: 188 - [c41]Dimitris Achlioptas, Amos Fiat, Anna R. Karlin, Frank McSherry:
Web Search via Hub Synthesis. FOCS 2001: 500-509 - [c40]Anna R. Karlin:
Web Search via Hub Synthesis. RANDOM-APPROX 2001: 6 - [c39]Joseph Hall, Jason D. Hartline, Anna R. Karlin, Jared Saia, John Wilkes:
On algorithms for efficient data migration. SODA 2001: 620-629 - [c38]Anna R. Karlin, Claire Kenyon, Dana Randall:
Dynamic TCP acknowledgement and other stories about e/(e-1). STOC 2001: 502-509 - [c37]Yossi Azar, Amos Fiat, Anna R. Karlin, Frank McSherry, Jared Saia:
Spectral analysis of data. STOC 2001: 619-626 - [c36]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. WAE 2001: 145-158 - 2000
- [j15]Tracy Kimbrel, Anna R. Karlin:
Near-Optimal Parallel Prefetching and Caching. SIAM J. Comput. 29(4): 1051-1082 (2000) - [j14]Anna R. Karlin, Steven J. Phillips, Prabhakar Raghavan:
Markov Paging. SIAM J. Comput. 30(3): 906-922 (2000) - [c35]Stefan Savage, David Wetherall, Anna R. Karlin, Thomas E. Anderson:
Practical network support for IP traceback. SIGCOMM 2000: 295-306 - [c34]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
1990 – 1999
- 1999
- [j13]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) - [j12]Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal
:
Balanced Allocations. SIAM J. Comput. 29(1): 180-200 (1999) - [c33]Eric J. Anderson, Kirsten Hildrum, Anna R. Karlin, April Rasala, Michael E. Saks:
On List Update and Work Function Algorithms. ESA 1999: 289-300 - [c32]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 - [c31]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 - [c30]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 - [c29]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 - 1998
- [c28]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
- [j11]Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nathan Linial, Steven J. Phillips:
Biased Random Walks. Comb. 16(1): 1-18 (1996) - [j10]Sandy Irani, Anna R. Karlin, Steven J. Phillips:
Strongly Competitive Algorithms for Paging with Locality of Reference. SIAM J. Comput. 25(3): 477-497 (1996) - [j9]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) - [c27]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 - [c26]Anna R. Karlin:
On the Performance of Competitive Algorithms in Practice. Online Algorithms 1996: 373-384 - [c25]Tracy Kimbrel, Anna R. Karlin:
Near-Optimal Parallel Prefetching and Caching. FOCS 1996: 540-549 - [c24]Craig Anderson, Anna R. Karlin:
Two Adaptive Hybrid Cache Coherency Protocols. HPCA 1996: 303-313 - [c23]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 - [c22]Tracy Kimbrel, Pei Cao, Edward W. Felten, Anna R. Karlin, Kai Li:
Integrating Parallel Prefetching and Caching. SIGMETRICS 1996: 262-263 - 1995
- [c21]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 - [c20]Pei Cao, Edward W. Felten, Anna R. Karlin, Kai Li:
A Study of Integrated Prefetching and Caching Strategies. SIGMETRICS 1995: 188-197 - [c19]Michael J. Feeley, William E. Morgan, Frédéric H. Pighin, Anna R. Karlin, Henry M. Levy, Chandramohan A. Thekkath:
Implementing Global Memory Management in a Workstation Cluster. SOSP 1995: 201-212 - [c18]Amos Fiat, Anna R. Karlin:
Randomized and multipointer paging with locality of reference. STOC 1995: 626-634 - 1994
- [j8]Anna R. Karlin, Mark S. Manasse, Lyle A. McGeoch, Susan S. Owicki:
Competitive Randomized Algorithms for Nonuniform Problems. Algorithmica 11(6): 542-571 (1994) - [j7]Hendrik A. Goosen, Anna R. Karlin, David R. Cheriton, Dieter Polzin:
Chiron parallel program performance visualization system. Comput. Aided Des. 26(12): 899-906 (1994) - [j6]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) - [j5]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) - [j4]Yossi Azar
, Andrei Z. Broder, Anna R. Karlin:
On-Line Load Balancing. Theor. Comput. Sci. 130(1): 73-84 (1994) - [c17]Anna R. Karlin, Greg Nelson, Hisao Tamaki:
On the fault tolerance of the butterfly. STOC 1994: 125-133 - [c16]Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal
:
Balanced allocations (extended abstract). STOC 1994: 593-602 - 1992
- [c15]Anna R. Karlin, Steven J. Phillips, Prabhakar Raghavan:
Markov Paging (Extended Abstract). FOCS 1992: 208-217 - [c14]Yossi Azar, Andrei Z. Broder, Anna R. Karlin:
On-line Load Balancing (Extended Abstract). FOCS 1992: 218-225 - [c13]Susan S. Owicki, Anna R. Karlin:
Factors in the Performance of the AN1 Computer Network. SIGMETRICS 1992: 167-180 - [c12]Sandy Irani, Anna R. Karlin, Steven J. Phillips:
Strongly Competitive Algorithms for Paging with Locality of Reference. SODA 1992: 228-236 - [c11]Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nathan Linial, Steven J. Phillips:
Biased Random Walks. STOC 1992: 1-9 - 1991
- [c10]Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal:
On the Parallel Complexity of Evaluating Game Trees. SODA 1991: 404-413 - [c9]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
- [c8]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 - [c7]Andrei Z. Broder, Anna R. Karlin:
Multilevel Adaptive Hashing. SODA 1990: 43-53 - [c6]Anna R. Karlin, Mark S. Manasse, Lyle A. McGeoch, Susan S. Owicki:
Competitive Randomized Algorithms for Non-Uniform Problems. SODA 1990: 301-309
1980 – 1989
- 1989
- [c5]Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal:
Trading Space for Time in Undirected s-t Connectivity. STOC 1989: 543-549 - 1988
- [j3]Anna R. Karlin, Mark S. Manasse, Larry Rudolph, Daniel Dominic Sleator:
Competitive Snoopy Caching. Algorithmica 3: 77-119 (1988) - [j2]Anna R. Karlin, Eli Upfal
:
Parallel hashing: an efficient implementation of shared memory. J. ACM 35(4): 876-892 (1988) - [c4]Andrei Z. Broder, Anna R. Karlin:
Bounds on the Cover Time (Preliminary Version). FOCS 1988: 479-487 - [c3]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 - 1987
- [b1]Anna R. Karlin:
Sharing memory in distributed systems : methods and applications. Stanford University, USA, 1987 - [j1]Anna R. Karlin, Howard Trickey, Jeffrey D. Ullman:
Algorithms for the Compilation of Regular Expressions into PLAs. Algorithmica 2: 283-314 (1987) - 1986
- [c2]Anna R. Karlin, Mark S. Manasse, Larry Rudolph, Daniel Dominic Sleator:
Competitive Snoopy Caching. FOCS 1986: 244-254 - [c1]Anna R. Karlin, Eli Upfal:
Parallel Hashing-An Efficient Implementation of Shared Memory (Preliminary Version). STOC 1986: 160-168
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-14 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint