BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Australia
1 × Austria
1 × Denmark
1 × Israel
1 × Poland
15 × USA
2 × China
2 × France
2 × Greece
3 × Canada
Collaborated with:
P.Raghavan A.Z.Broder D.Peleg M.Riondato A.R.Karlin A.M.Frieze A.Wigderson R.Kumar R.M.Karp U.Çetintemel M.Mahdian G.Pandurangan A.Borodin M.Akdere R.Kleinberg A.Slivkins I.Katriel C.Kenyon-Mathieu D.Krizanc O.Ohrimenko M.T.Goodrich R.Tamassia J.A.DeBrabant R.Fonseca B.Bahmani J.Duggan O.Papaemmanouil A.Anagnostopoulos Y.Azar B.Schieber E.Shamir U.Feige C.Dwork N.Pippenger F.E.Fich F.M.a.d.Heide A.Kirsch M.Mitzenmacher A.Pietracaprina G.Pucci F.Vandin F.Chierichetti A.Panconesi M.Sozio A.Tiberi S.Rajagopalan D.Sivakumar A.Tomkins G.P.Arumugam P.Srikanthan J.Augustine K.V.Palem A.Bhargava Parishkrati S.Yenugula
Talks about:
rout (6) effici (5) comput (5) graph (5) algorithm (4) parallel (4) random (4) dynam (4) construct (3) tradeoff (3)

Person: Eli Upfal

DBLP DBLP: Upfal:Eli

Contributed to:

DATE 20152015
KDD 20152015
ICALP (2) 20142014
CIKM 20122012
KDD 20122012
SIGMOD 20112011
VLDB 20102010
ICALP (2) 20092009
PODS 20092009
STOC 20082008
ICALP 20072007
PODS 20072007
PODS 20002000
STOC 19991999
STOC 19971997
STOC 19961996
STOC 19951995
ICALP 19941994
STOC 19941994
STOC 19931993
ICALP 19921992
STOC 19921992
STOC 19901990
STOC 19891989
STOC 19881988
STOC 19871987
ICALP 19861986
STOC 19861986
STOC 19851985
STOC 19841984

Wrote 36 papers:

DATE-2015-ArumugamSAPUBPY #algorithm #co-evolution #design #energy #memory management #novel #performance
Novel inexact memory aware algorithm co-design for energy efficient computation: algorithmic principles (GPA, PS, JA, KVP, EU, AB, P, SY), pp. 752–757.
KDD-2015-RiondatoU #mining
Mining Frequent Itemsets through Progressive Sampling with Rademacher Averages (MR, EU), pp. 1005–1014.
KDD-2015-RiondatoU15a #algorithm #learning #statistics
VC-Dimension and Rademacher Averages: From Statistical Learning Theory to Sampling Algorithms (MR, EU), pp. 2321–2322.
ICALP-v2-2014-OhrimenkoGTU #in the cloud
The Melbourne Shuffle: Improving Oblivious Storage in the Cloud (OO, MTG, RT, EU), pp. 556–567.
CIKM-2012-RiondatoDFU #algorithm #approximate #mining #named #parallel #pipes and filters #random
PARMA: a parallel randomized algorithm for approximate association rules mining in MapReduce (MR, JAD, RF, EU), pp. 85–94.
KDD-2012-BahmaniKMU #evolution #graph #rank
PageRank on an evolving graph (BB, RK, MM, EU), pp. 24–32.
SIGMOD-2011-DugganCPU #concurrent #database #performance #predict
Performance prediction for concurrent database workloads (JD, , OP, EU), pp. 337–348.
VLDB-2010-AkdereCU #predict #query #streaming
Database-support for Continuous Prediction Queries over Streaming Data (MA, , EU), pp. 1291–1301.
ICALP-v2-2009-AnagnostopoulosKMU #how
Sort Me If You Can: How to Sort Dynamic Data (AA, RK, MM, EU), pp. 339–350.
PODS-2009-KirschMPPUV #approach #identification #performance #statistics
An efficient rigorous approach for identifying statistically significant frequent itemsets (AK, MM, AP, GP, EU, FV), pp. 117–126.
STOC-2008-KleinbergSU #metric #multi
Multi-armed bandits in metric spaces (RK, AS, EU), pp. 681–690.
ICALP-2007-KatrielKU #nondeterminism #probability #problem
Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems (IK, CKM, EU), pp. 171–182.
PODS-2007-ChierichettiPRSTU #clustering
Finding near neighbors through cluster pruning (FC, AP, PR, MS, AT, EU), pp. 103–112.
PODS-2000-KumarRRSTU #graph #web
The Web as a Graph (RK, PR, SR, DS, AT, EU), pp. 1–10.
STOC-1999-PanduranganU #evaluation
Static and Dynamic Evaluation of QoS Properties (GP, EU), pp. 566–573.
STOC-1997-BroderFU #approach #graph #random
Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (AZB, AMF, EU), pp. 531–539.
STOC-1996-BroderU #array
Dynamic Deflection Routing on Arrays (AZB, EU), pp. 348–355.
STOC-1995-RaghavanU #probability
Stochastic contention resolution with short delays (PR, EU), pp. 229–237.
ICALP-1994-Upfal #formal method #network #on the #parallel
On the Theory of Interconnection Networks for Parallel Computers (EU), pp. 473–486.
Balanced allocations (YA, AZB, ARK, EU), pp. 593–602.
STOC-1994-RaghavanU #network #performance
Efficient routing in all-optical networks (PR, EU), pp. 134–143.
STOC-1993-BorodinRSU #hardware #how #question
How much can hardware help routing? (AB, PR, BS, EU), pp. 573–582.
Near-perfect Token Distribution (AZB, AMF, ES, EU), pp. 308–317.
STOC-1992-BroderFU #graph
Existence and Construction of Edge Disjoint Paths on Expander Graphs (AZB, AMF, EU), pp. 140–149.
Computing with Unreliable Information (UF, DP, PR, EU), pp. 128–137.
Trading Space for Time in Undirected s-t Connectivity (AZB, ARK, PR, EU), pp. 543–549.
An O(log N) Deterministic Packet Routing Scheme (EU), pp. 241–250.
STOC-1988-KrizancPU #trade-off
A Time-Randomness Tradeoff for Oblivious Routing (DK, DP, EU), pp. 93–102.
STOC-1988-PelegU #performance #trade-off
A Tradeoff between Space and Efficiency for Routing Tables (DP, EU), pp. 43–52.
STOC-1987-PelegU #graph
Constructing Disjoint Paths on Expander Graphs (DP, EU), pp. 264–273.
ICALP-1986-BorodinFHUW #problem #taxonomy #trade-off
A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem (AB, FEF, FMadH, EU, AW), pp. 50–59.
STOC-1986-DworkPPU #bound #fault tolerance #network
Fault Tolerance in Networks of Bounded Degree (CD, DP, NP, EU), pp. 370–379.
STOC-1986-KarlinU #implementation #memory management #parallel #performance
Parallel Hashing-An Efficient Implementation of Shared Memory (ARK, EU), pp. 160–168.
STOC-1985-KarpUW #random
Constructing a Perfect Matching is in Random NC (RMK, EU, AW), pp. 22–32.
STOC-1985-KarpUW85a #problem #question
Are Search and Decision Problems Computationally Equivalent? (RMK, EU, AW), pp. 464–475.
STOC-1984-Upfal #modelling #parallel #probability
A Probabilistic Relation between Desirable and Feasible Models of Parallel Computation (A Preliminary Version) (EU), pp. 258–265.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.