Travelled to:
1 × France
1 × Iceland
1 × Latvia
2 × Greece
3 × Canada
9 × USA
Collaborated with:
E.Upfal A.Fiat Y.Azar A.Z.Broder C.Anderson H.M.Levy B.E.Birnbaum P.Raghavan L.E.Celis D.C.Gklezakos C.Kenyon D.Randall G.Nelson H.Tamaki G.M.Voelker M.J.Feeley A.V.Goldberg J.D.Hartline K.Li M.S.Manasse S.S.Owicki G.Borriello A.D.Flaxman B.DeRenzi N.Chen N.Immorlica M.Mahdian A.Rudra C.Mathieu C.T.Nguyen F.McSherry J.Saia N.Linial S.Phillips A.Wolman N.Sharma N.Cardwell W.E.Morgan F.H.Pighin C.A.Thekkath H.A.Jamrozik J.E.II M.K.Vernon R.Fagin J.M.Kleinberg S.Rajagopalan R.Rubinfeld M.Sudan A.Tomkins
Talks about:
memori (4) random (3) implement (2) competit (2) approxim (2) global (2) share (2) alloc (2) walk (2) data (2)
Person: Anna R. Karlin
DBLP: Karlin:Anna_R=
Contributed to:
Wrote 19 papers:
- CHI-2013-BirnbaumBFDK #behaviour #identification #using
- Using behavioral data to identify interviewer fabrication in surveys (BEB, GB, ADF, BD, ARK), pp. 2911–2920.
- ICALP-v2-2013-CelisGK #information management #on the
- On Revenue Maximization for Agents with Costly Information Acquisition — Extended Abstract (LEC, DCG, ARK), pp. 484–495.
- ICALP-v1-2009-ChenIKMR #approximate
- Approximating Matches Made in Heaven (NC, NI, ARK, MM, AR), pp. 266–278.
- ICALP-A-2008-AzarBKMN #algorithm #approximate
- Improved Approximation Algorithms for Budgeted Allocations (YA, BEB, ARK, CM, CTN), pp. 186–197.
- STOC-2002-FiatGHK
- Competitive generalized auctions (AF, AVG, JDH, ARK), pp. 72–81.
- STOC-2001-AzarFKMS #analysis
- Spectral analysis of data (YA, AF, ARK, FM, JS), pp. 619–626.
- STOC-2001-KarlinKR
- Dynamic TCP acknowledgement and other stories about e/(e-1) (ARK, CK, DR), pp. 502–509.
- STOC-2000-FaginKKRRRST #random
- Random walks with “back buttons” (RF, ARK, JMK, PR, SR, RR, MS, AT), pp. 484–493.
- SOSP-1999-WolmanVSCKL #on the #performance #web
- On the scale and performance of cooperative Web proxy caching (AW, GMV, NS, NC, ARK, HML), pp. 16–31.
- ASPLOS-1996-JamrozikFVEKLV #latency #memory management #network #using
- Reducing Network Latency Using Subpages in a Global Memory Environment (HAJ, MJF, GMV, JEI, ARK, HML, MKV), pp. 258–267.
- HPCA-1996-AndersonK #adaptation #hybrid #protocol
- Two Adaptive Hybrid Cache Coherency Protocols (CA, ARK), pp. 303–313.
- SOSP-1995-FeeleyMPKL #clustering #implementation #memory management
- Implementing Global Memory Management in a Workstation Cluster (MJF, WEM, FHP, ARK, HML, CAT), pp. 201–212.
- STOC-1995-FiatK #locality #multi #random
- Randomized and multipointer paging with locality of reference (AF, ARK), pp. 626–634.
- STOC-1994-AzarBKU
- Balanced allocations (YA, AZB, ARK, EU), pp. 593–602.
- STOC-1994-KarlinNT #fault tolerance #on the
- On the fault tolerance of the butterfly (ARK, GN, HT), pp. 125–133.
- STOC-1992-AzarBKLP #random
- Biased Random Walks (YA, AZB, ARK, NL, SP), pp. 1–9.
- SOSP-1991-KarlinLMO #empirical #multi
- Empirical Studies of Competitive Spinning for a Shared-Memory Multiprocessor (ARK, KL, MSM, SSO), pp. 41–55.
- STOC-1989-BroderKRU
- Trading Space for Time in Undirected s-t Connectivity (AZB, ARK, PR, EU), pp. 543–549.
- STOC-1986-KarlinU #implementation #memory management #parallel #performance
- Parallel Hashing-An Efficient Implementation of Shared Memory (ARK, EU), pp. 160–168.