Travelled to:1 × Greece
1 × Portugal
1 × United Kingdom
14 × USA
2 × France
Collaborated with:S.A.Cook Y.Ye P.Raghavan H.C.Lee R.Ostrovsky Y.Rabani B.Lucier D.Pankratov B.Schieber P.Tiwari J.E.Hopcroft ∅ E.Upfal F.E.Fich A.Wigderson L.Goldsmith D.Cashman A.Magen W.L.Ruzzo M.Tompa N.Linial M.E.Saks S.Irani D.Dolev W.J.Paul J.M.Kleinberg M.Sudan D.P.Williamson S.Ben-David R.M.Karp G.Tardos F.M.a.d.Heide
Talks about:algorithm (4) problem (4) search (3) comput (3) local (3) bound (3) dimension (2) tradeoff (2) polynomi (2) function (2)
Person: Allan Borodin
DBLP: Borodin:Allan
Facilitated 2 volumes:
EdEdContributed to:
2012
2010
20102009
200820051999199619931991199019891987198619831982198019741969Wrote 21 papers:
- PODS-2012-BorodinLY
- Max-Sum diversification, monotone submodular functions and dynamic updates (AB, HCL, YY), pp. 155–166.
- ICALP-v1-2010-BorodinL #combinator #design #on the
- On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions (AB, BL), pp. 90–101.
- SAT-2010-PankratovB #on the #problem #satisfiability
- On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem (DP, AB), pp. 223–236.
- ICALP-v1-2009-YeB #graph
- Elimination Graphs (YY, AB), pp. 774–785.
- HT-2008-LeeBG #community #ranking #similarity #using
- Extracting and ranking viral communities using seeds and content similarity (HCL, AB, LG), pp. 139–148.
- ICALP-2005-BorodinCM #algorithm #how #question
- How Well Can Primal-Dual and Local-Ratio Algorithms Perform? (AB, DC, AM), pp. 943–955.
- STOC-1999-BorodinOR #bound #nearest neighbour #problem
- Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems (AB, RO, YR), pp. 312–321.
- STOC-1999-BorodinOR99a #algorithm #approximate #clustering #problem
- Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces (AB, RO, YR), pp. 435–444.
- STOC-1996-BorodinKRSW
- Adversarial Queueing Theory (AB, JMK, PR, MS, DPW), pp. 376–385.
- STOC-1993-BorodinRSU #hardware #how #question
- How much can hardware help routing? (AB, PR, BS, EU), pp. 573–582.
- STOC-1991-BorodinIRS #locality
- Competitive Paging with Locality of Reference (AB, SI, PR, BS), pp. 249–259.
- STOC-1990-Ben-DavidBKTW #algorithm #on the #online #power of
- On the Power of Randomization in Online Algorithms (SBD, AB, RMK, GT, AW), pp. 379–386.
- STOC-1990-BorodinT #decidability #on the #polynomial
- On the Decidability of Sparse Univariate Polynomial Interpolation (AB, PT), pp. 535–545.
- STOC-1989-BorodinRT #bound #sequence #traversal
- Lower Bounds on the Length of Universal Traversal Sequences (AB, WLR, MT), pp. 562–573.
- STOC-1987-BorodinLS #algorithm #online
- An Optimal Online Algorithm for Metrical Task Systems (AB, NL, MES), pp. 373–382.
- 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-1983-BorodinDFP #bound #branch #source code
- Bounds for Width Two Branching Programs (AB, DD, FEF, WJP), pp. 87–93.
- STOC-1982-BorodinH #modelling #parallel #sorting
- Routing, Merging and Sorting on Parallel Models of Computation (AB, JEH), pp. 338–344.
- STOC-1980-BorodinC #sorting #trade-off
- A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation (AB, SAC), pp. 294–301.
- STOC-1974-BorodinC #on the
- On the Number of Additions to Compute Specific Polynomials (AB, SAC), pp. 342–347.
- STOC-1969-Borodin #complexity #recursion
- Complexity Classes of Recursive Functions and the Existence of Complexity Gaps (AB), pp. 67–78.