Anna Karlin | Academic Influence

Anna Karlin's AcademicInfluence.com Rankings

Anna Karlin

Computer Science

#1947

World Rank

#2023

Historical Rank

#919

USA Rank

Database

#7579

World Rank

#7866

Historical Rank

#939

USA Rank

computer-science Degrees

Download Badge

Computer Science

Anna Karlin's Degrees

PhD Computer Science Stanford University
Masters Computer Science Stanford University
Bachelors Mathematics Stanford University

Similar Degrees You Can Earn

Why Is Anna Karlin Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Anna R. Karlin is an American computer scientist, the Microsoft Professor of Computer Science & Engineering at the University of Washington. Biography Karlin was born into an academic family. Her father, Samuel Karlin, was a mathematician at Stanford University, and her brother, Kenneth Karlin, is a professor of chemistry at Johns Hopkins University.

(See a Problem?)

Anna Karlin's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Practical network support for IP traceback (2000) (1419)
Balanced Allocations (1999) (768)
Network support for IP traceback (2001) (753)
Competitive snoopy caching (1986) (663)
On the scale and performance of cooperative Web proxy caching (2000) (484)
Dynamic perfect hashing: upper and lower bounds (1988) (474)
Implementing global memory management in a workstation cluster (1995) (401)
Competitive randomized algorithms for nonuniform problems (1990) (382)
A study of integrated prefetching and caching strategies (1995) (368)
On profit-maximizing envy-free pricing (2005) (333)
Spectral analysis of data (2001) (307)
Implementation and performance of integrated application-controlled file caching, prefetching, and disk scheduling (1996) (255)
On-line load balancing (1992) (254)
Competitive auctions (2006) (244)
Greedy bidding strategies for keyword auctions (2007) (169)
On the scale and performance of cooperative Web proxy caching (1999) (167)
Empirical studies of competitve spinning for a shared-memory multiprocessor (1991) (161)
Competitive generalized auctions (2002) (153)
A trace-driven comparison of algorithms for parallel prefetching and caching (1996) (144)
Bounds on the cover time (1988) (127)
Strongly competitive algorithms for paging with locality of reference (1992) (124)
Markov paging (1992) (122)
Parallel hashing: an efficient implementation of shared memory (1988) (120)
Organization-Based Analysis of Web-Object Sharing and Caching (1999) (120)
Dynamic TCP acknowledgement and other stories about e/(e-1) (2001) (120)
Reducing TLB and memory overhead using online superpage promotion (1995) (119)
Dynamically Fault-Tolerant Content Addressable Networks (2002) (116)
Balanced allocations (extended abstract) (1994) (116)
Approximating Matches Made in Heaven (2009) (114)
Beyond VCG: frugality of truthful mechanisms (2005) (106)
Implementing cooperative prefetching and caching in a globally-managed memory system (1998) (101)
On algorithms for efficient data migration (2001) (101)
Online computation (1996) (101)
Multilevel adaptive hashing (1990) (95)
Trading space for time in undirected s-t connectivity (1989) (88)
An Experimental Study of Data Migration Algorithms (2001) (80)
Near-optimal parallel prefetching and caching (1996) (79)
Evaluating Competitive Game Balance with Restricted Play (2012) (79)
Truthful and Competitive Double Auctions (2002) (75)
Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack (2010) (74)
Dynamic TCP Acknowledgment and Other Stories about e/(e - 1) (2003) (73)
On profit maximization in mechanism design (2007) (72)
Parallel hashing—an efficient implementation of shared memory (1986) (69)
A (slightly) improved approximation algorithm for metric TSP (2020) (67)
Biased random walks (1992) (65)
Asymptotically tight bounds for computing with faulty arrays of processors (1990) (64)
Random walks with `back buttons' (2001) (62)
Web search via hub synthesis (2001) (62)
Randomized and multipointer paging with locality of reference (1995) (58)
Prior-Independent Multi-parameter Mechanism Design (2011) (46)
Game Theory, Alive (2017) (41)
Integrated parallel prefetching and caching (1996) (40)
On the Equilibria and Efficiency of the GSP Mechanism in Keyword Auctions with Externalities (2008) (39)
Reducing network latency using subpages in a global memory environment (1996) (38)
Factors in the performance of the AN1 computer network (1992) (36)
A Prior-Independent Revenue-Maximizing Auction for Multiple Additive Bidders (2016) (36)
Improved Approximation Algorithms for Budgeted Allocations (2008) (35)
Approximate revenue maximization in interdependent value settings (2014) (35)
Simple Pricing Schemes For Consumers With Evolving Values (2016) (30)
Pursuing the performance potential of dynamic cache line sizes (1999) (28)
Two adaptive hybrid cache coherency protocols (1996) (27)
Using behavioral data to identify interviewer fabrication in surveys (2013) (25)
Stability of service under time-of-use pricing (2017) (25)
Auctions for structured procurement (2008) (25)
On the fault tolerance of the butterfly (1994) (24)
A Lower Bound on the Competitive Ratio of Truthful Auctions (2004) (24)
Energy Equilibria in Proof-of-Work Mining (2019) (24)
Random walks with “back buttons” (extended abstract) (2000) (23)
A simply exponential upper bound on the maximum number of stable matchings (2017) (23)
Cheap labor can be expensive (2007) (21)
Approaching utopia: strong truthfulness and externality-resistant mechanisms (2012) (20)
An Empirical Evaluation of Virtual Circuit Holding Time Policies in IP-over-ATM Networks (1995) (20)
Algorithms for Data Migration (2010) (19)
Beyond Competitive Analysis (2020) (17)
An improved approximation algorithm for TSP in the half integral case (2019) (16)
On the Performance of Competitive Algorithms in Practice (1996) (16)
Experience with a regular expression compiler (1983) (16)
On the Effects of Competing Advertisements in Keyword Auctions (2008) (16)
Potentials and limitations of fault-based Markov prefetching for virtual memory pages (1999) (15)
Spectral methods for data analysis (2004) (13)
Approximately Revenue-Maximizing Auctions for Deliberative Agents (2012) (13)
Combinatorial Auctions with Interdependent Valuations: SOS to the Rescue (2019) (13)
The FedEx Problem (2016) (12)
Profit maximization in mechanism design: beyond the bayesian approach (2011) (12)
Convergence of Position Auctions under Myopic Best-Response Dynamics (2014) (12)
Algorithmic Approaches to Detecting Interviewer Fabrication in Surveys (2012) (11)
Optimization in the private value model: competitive analysis applied to auction design (2003) (11)
On a Competitive Secretary Problem (2015) (10)
On the parallel complexity of evaluating game trees (1991) (9)
Random Walks and Undirected Graph Connectivity: A Survey (1995) (9)
Balloon Popping With Applications to Ascending Auctions (2007) (9)
On Revenue Maximization in Second-Price Ad Auctions (2009) (9)
A quantitative evaluation of traffic-aware routing strategies (2002) (7)
Data mining through spectral analy - sis (2001) (7)
Spectral Analysis for Data Mining (2001) (6)
A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSP (2021) (6)
Chiron parallel program performance visualization system (1994) (5)
On-line Load Balancing (Extended Abstract) (1992) (5)
Markov Paging (Extended Abstract) (1992) (5)
Matroid Partition Property and the Secretary Problem (2021) (4)
A multicommodity flow based approach to adaptive internet routing (2002) (4)
Games and Economic Behavior (2006) (3)
An improved approximation algorithm for the minimum k-edge connected multi-subgraph problem (2021) (3)
On Algorithms for EÆcient Data Migration (3)
Non-Adaptive Matroid Prophet Inequalities (2020) (3)
Ad Auctions - Current and Future Research (2007) (2)
On list update and work function algorithms (1999) (2)
Integrating Parallel Prefetching and Caching (1996) (2)
Sharing memory in distributed systems : methods and applications (1987) (2)
Bounds on the Cover Time (Preliminary Version) (1988) (1)
On Revenue Maximization for Agents with Costly Information Acquisition - Extended Abstract (2013) (1)
Thinking Twice about Second-Price Ad Auctions (2008) (1)
Selling in Exclusive Markets: Some Observations on Prior-Free Mechanism Design (2013) (1)
Algorithms for the compilation of regular expressions into PLAs (1987) (1)
CSE 525 : Randomized Algorithms and Probabilistic Analysis (2013) (1)
On the Fault Tolerance of the Butter y (1994) (1)
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009) (1)
LECTURE 25 (2008) (1)
A (Slightly) Improved Deterministic Approximation Algorithm for Metric TSP (2022) (1)
Competition Alleviates Present Bias in Task Completion (2020) (1)
Competitive Algorithms for On-line Paging and Graph Coloring (1992) (1)
COMPETITIVE SNOOPY CACHING1 (1987) (1)
Carpooling in Social Networks (2016) (0)
An Experimental Study of Data (2001) (0)
Models for keyword auctions (2009) (0)
Network effects in algorithmic game theory (2008) (0)
CSE 522 : Algorithms and Uncertainty Spring 2017 Lecture 4 — April 7 , 2017 (2017) (0)
How to sell an app: pay-per-play or buy-it-now? (2014) (0)
Information Economics in the Age of e-Commerce: Models and Mechanisms for Information-Rich Markets (2012) (0)
1 Constructive proof of Lovasz Local Lemma ( LLL ) (2013) (0)
CSE 525 : Randomized Algorithms and Probabilistic Analysis April (2013) (0)
Algorithms for single shot and repeated 0-sum games April 8 , 2005 Lecturer : (2005) (0)
Mechanism Design for Fun and Profit (2002) (0)
Truthful and Competitive Double Au (2002) (0)
Competitive Algorithms (Dagstuhl Seminar 99251) (2021) (0)
5.2 Data Race Detection 5.3 Distributed Garbage Collection 5.4 Tracing True Sharing (1999) (0)
CSE 522 : Algorithms and Uncertainty Spring 2017 Lecture 1 — March 27 , 2017 (2017) (0)
Fairness in Scheduling On-line Load Balancing with Applications to Machine Scheduling and Virtual Circuit Routing. In (1995) (0)
Pairing Things Off: Counting Stable Matchings, Finding Your Ride, and Designing Tournaments (2020) (0)
A Note on the Influence of an epsilon-Biased Random Source (1999) (0)
Lecture 10 Convex Optimization and Lagrangian Duality April 29 (2005) (0)
6.2.2 Relative Cost (2011) (0)
The FedEx Problem ( Working Paper ) (2016) (0)
Data placement algorithms for news-on-demand servers (1997) (0)
Mechanism design for fun and profit — Invited Lecture — (2002) (0)

This paper list is powered by the following services:

Other Resources About Anna Karlin

en.wikipedia.org

What Schools Are Affiliated With Anna Karlin?

Anna Karlin is affiliated with the following schools: