default search action
Yuval Rabani
Person information
- affiliation: The Hebrew University of Jerusalem, Jerusalem, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c73]Spencer L. Gordon, Erik Jahn, Bijan Mazaheri, Yuval Rabani, Leonard J. Schulman:
Identification of mixtures of discrete product distributions in near-optimal sample and time complexity. COLT 2024: 2071-2091 - [i29]Yuval Rabani, Leonard J. Schulman, Alistair Sinclair:
Diversity in Evolutionary Dynamics. CoRR abs/2406.03938 (2024) - 2023
- [c72]Spencer L. Gordon, Bijan Mazaheri, Yuval Rabani, Leonard J. Schulman:
Causal Inference Despite Limited Global Confounding via Mixture Models. CLeaR 2023: 574-601 - [c71]Shichuan Deng
, Jian Li, Yuval Rabani:
Generalized Unrelated Machine Scheduling Problem. SODA 2023: 2898-2916 - [c70]Sébastien Bubeck, Christian Coester
The Randomized k-Server Conjecture Is False! STOC 2023: 581-594 - [i28]Spencer L. Gordon, Erik Jahn, Bijan Mazaheri, Yuval Rabani, Leonard J. Schulman:
Identification of Mixtures of Discrete Product Distributions in Near-Optimal Sample and Time Complexity. CoRR abs/2309.13993 (2023) - [i27]Bijan Mazaheri, Spencer Gordon, Yuval Rabani, Leonard J. Schulman:
Causal Discovery under Latent Class Confounding. CoRR abs/2311.07454 (2023) - 2022
- [j45]Krishnamurthy Dvijotham, Yuval Rabani, Leonard J. Schulman
Convergence of incentive-driven dynamics in Fisher markets. Games Econ. Behav. 134: 361-375 (2022) - [j44]Fabrizio Grandoni
A refined approximation for Euclidean k-means. Inf. Process. Lett. 176: 106251 (2022) - [j43]Shichuan Deng
Approximation algorithms for clustering with dynamic points. J. Comput. Syst. Sci. 130: 43-70 (2022) - [j42]Yuval Rabani
Corrigendum: Explicit Construction of a Small Epsilon-Net for Linear Threshold Functions. SIAM J. Comput. 51(5): 1692-1702 (2022) - [c69]Sébastien Bubeck, Christian Coester
Shortest Paths without a Map, but with an Entropic Regularizer. FOCS 2022: 1102-1113 - [i26]Sébastien Bubeck, Christian Coester, Yuval Rabani:
Shortest Paths without a Map, but with an Entropic Regularizer. CoRR abs/2202.04551 (2022) - [i25]Shichuan Deng, Jian Li, Yuval Rabani:
Generalized Unrelated Machine Scheduling Problem. CoRR abs/2202.06292 (2022) - [i24]Sébastien Bubeck, Christian Coester, Yuval Rabani:
The Randomized k-Server Conjecture is False! CoRR abs/2211.05753 (2022) - 2021
- [c68]Sandip Banerjee
Min-Sum Clustering (With Outliers). APPROX-RANDOM 2021: 16:1-16:16 - [c67]Spencer Gordon, Bijan H. Mazaheri, Yuval Rabani, Leonard J. Schulman:
Source Identification for Mixtures of Product Distributions. COLT 2021: 2193-2216 - [c66]Simina Brânzei, Nikhil R. Devanur, Yuval Rabani:
Proportional Dynamics in Exchange Economies. EC 2021: 180-201 - [c65]Sébastien Bubeck, Yuval Rabani, Mark Sellke:
Online Multiserver Convex Chasing and Optimization. SODA 2021: 2093-2104 - [i23]Fabrizio Grandoni, Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Rakesh Venkat:
A Refined Approximation for Euclidean k-Means. CoRR abs/2107.07358 (2021) - [i22]Spencer L. Gordon, Bijan Mazaheri, Yuval Rabani, Leonard J. Schulman:
Identifying Mixtures of Bayesian Network Distributions. CoRR abs/2112.11602 (2021) - 2020
- [c64]Sébastien Bubeck, Yuval Rabani:
Parametrized Metrical Task Systems. APPROX-RANDOM 2020: 54:1-54:14 - [c63]Shichuan Deng, Jian Li, Yuval Rabani:
Approximation Algorithms for Clustering with Dynamic Points. ESA 2020: 37:1-37:15 - [i21]Sébastien Bubeck, Yuval Rabani, Mark Sellke:
Online Multiserver Convex Chasing and Optimization. CoRR abs/2004.07346 (2020) - [i20]Shichuan Deng, Jian Li, Yuval Rabani:
Approximation Algorithms for Clustering with Dynamic Points. CoRR abs/2006.14403 (2020) - [i19]Spencer Gordon, Bijan Mazaheri, Leonard J. Schulman, Yuval Rabani:
The Sparse Hausdorff Moment Problem, with Application to Topic Models. CoRR abs/2007.08101 (2020) - [i18]Sandip Banerjee, Rafail Ostrovsky, Yuval Rabani:
Min-Sum Clustering (with Outliers). CoRR abs/2011.12169 (2020) - [i17]Spencer L. Gordon, Bijan Mazaheri, Yuval Rabani, Leonard J. Schulman:
Source Identification for Mixtures of Product Distributions. CoRR abs/2012.14540 (2020)
2010 – 2019
- 2019
- [i16]Sébastien Bubeck, Yuval Rabani:
Parametrized Metrical Task Systems. CoRR abs/1904.03874 (2019) - [i15]Simina Brânzei, Nikhil R. Devanur, Yuval Rabani:
Proportional Dynamics in Exchange Economies. CoRR abs/1907.05037 (2019) - 2018
- [c62]Rafail Ostrovsky, Yuval Rabani, Arman Yousefi:
Strictly Balancing Matrices in Polynomial Time Using Osborne's Iteration. ICALP 2018: 93:1-93:11 - 2017
- [c61]Yuval Rabani, Rakesh Venkat:
Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low Dimensional Spaces. APPROX-RANDOM 2017: 21:1-21:14 - [c60]Rafail Ostrovsky, Yuval Rabani
Matrix Balancing in Lp Norms: Bounding the Convergence Rate of Osborne's Iteration. SODA 2017: 154-169 - [c59]Krishnamurthy Dvijotham, Yuval Rabani
Convergence of Incentive-Driven Dynamics in Fisher Markets. SODA 2017: 554-567 - [i14]Rafail Ostrovsky, Yuval Rabani, Arman Yousefi:
Strictly Balancing Matrices in Polynomial Time Using Osborne's Iteration. CoRR abs/1704.07406 (2017) - [i13]Yuval Rabani, Rakesh Venkat:
Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low-Dimensional Spaces. CoRR abs/1706.06806 (2017) - 2016
- [j41]Yuval Rabani
Editorial to the Special Issue on SODA'12. ACM Trans. Algorithms 12(1): 1:1 (2016) - [e2]Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, Davide Sangiorgi:
43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy. LIPIcs 55, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-013-2 [contents] - [i12]Krishnamurthy Dvijotham, Yuval Rabani, Leonard J. Schulman:
Market Dynamics of Best-Response with Lookahead. CoRR abs/1605.09012 (2016) - [i11]Rafail Ostrovsky, Yuval Rabani, Arman Yousefi:
Matrix Balancing in Lp Norms: A New Analysis of Osborne's Iteration. CoRR abs/1606.08083 (2016) - 2015
- [j40]Noa Avigdor-Elgrabli, Yuval Rabani
An Improved Competitive Algorithm for Reordering Buffer Management. ACM Trans. Algorithms 11(4): 35:1-35:15 (2015) - [c58]Noa Avigdor-Elgrabli, Sungjin Im, Benjamin Moseley, Yuval Rabani
On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs. ICALP (1) 2015: 78-90 - [c57]Jian Li, Yuval Rabani
Learning Arbitrary Statistical Mixtures of Discrete Distributions. STOC 2015: 743-752 - [i10]Jian Li, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy:
Learning Arbitrary Statistical Mixtures of Discrete Distributions. CoRR abs/1504.02526 (2015) - 2014
- [c56]Yuval Rabani
Learning mixtures of arbitrary distributions over large discrete domains. ITCS 2014: 207-224 - [i9]Noa Avigdor-Elgrabli, Yuval Rabani:
Convergence of Tâtonnement in Fisher Markets. CoRR abs/1401.6637 (2014) - 2013
- [c55]Noa Avigdor-Elgrabli, Yuval Rabani
An optimal randomized online algorithm for reordering buffer management. FOCS 2013: 1-10 - [c54]Noa Avigdor-Elgrabli, Yuval Rabani
A Constant Factor Approximation Algorithm for Reordering Buffer Management. SODA 2013: 973-984 - [i8]Noa Avigdor-Elgrabli, Yuval Rabani:
An Optimal Randomized Online Algorithm for Reordering Buffer Management. CoRR abs/1303.3386 (2013) - 2012
- [j39]Rafail Ostrovsky, Yuval Rabani
The effectiveness of lloyd-type methods for the k-means problem. J. ACM 59(6): 28:1-28:22 (2012) - [j38]Zohar Shay Karnin, Yuval Rabani
Explicit Dimension Reduction and Its Applications. SIAM J. Comput. 41(1): 219-249 (2012) - [j37]Sanjeev Arora, László Lovász, Ilan Newman, Yuval Rabani
Local Versus Global Properties of Metric Spaces. SIAM J. Comput. 41(1): 250-271 (2012) - [c53]Alfonso Cevallos
Unconditionally-Secure Robust Secret Sharing with Compact Shares. EUROCRYPT 2012: 195-208 - [c52]Yuval Rabani:
Learning Mixtures of Distributions over Large Discrete Domains. FSTTCS 2012: 1-3 - [e1]Yuval Rabani:
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012. SIAM 2012, ISBN 978-1-61197-210-8 [contents] - [i7]Noa Avigdor-Elgrabli, Yuval Rabani:
A Constant Factor Approximation Algorithm for Reordering Buffer Management. CoRR abs/1202.4504 (2012) - [i6]Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy:
Learning Mixtures of Arbitrary Distributions over Large Discrete Domains. CoRR abs/1212.1527 (2012) - 2011
- [j36]Gruia Calinescu
An improved approximation algorithm for resource allocation. ACM Trans. Algorithms 7(4): 48:1-48:7 (2011) - [c51]Zohar Shay Karnin, Yuval Rabani
Explicit Dimension Reduction and Its Applications. CCC 2011: 262-272 - [c50]Howard J. Karloff, Flip Korn, Konstantin Makarychev, Yuval Rabani:
On Parsimonious Explanations For 2-D Tree- and Linearly-Ordered Data. STACS 2011: 332-343 - [i5]Howard J. Karloff, Flip Korn, Konstantin Makarychev, Yuval Rabani:
On Parsimonious Explanations for 2-D Tree- and Linearly-Ordered Data. CoRR abs/1101.1941 (2011) - 2010
- [j35]Yuval Rabani
Explicit Construction of a Small Epsilon-Net for Linear Threshold Functions. SIAM J. Comput. 39(8): 3501-3520 (2010) - [c49]Noa Avigdor-Elgrabli, Yuval Rabani
An Improved Competitive Algorithm for Reordering Buffer Management. SODA 2010: 13-21 - [c48]Yossi Azar, Nikhil R. Devanur, Kamal Jain, Yuval Rabani
Monotonicity in Bargaining Networks. SODA 2010: 817-826 - [i4]Vladimir Braverman, Rafail Ostrovsky, Yuval Rabani:
Rademacher Chaos, Random Eulerian Graphs and The Sparse Johnson-Lindenstrauss Transform. CoRR abs/1011.2590 (2010)
2000 – 2009
- 2009
- [j34]Robert Krauthgamer
Improved Lower Bounds for Embeddings intoL1$. SIAM J. Comput. 38(6): 2487-2498 (2009) - [j33]Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani
On Earthmover Distance, Metric Labeling, and 0-Extension. SIAM J. Comput. 39(2): 371-387 (2009) - [j32]Claire Kenyon, Yuval Rabani
Low Distortion Maps Between Point Sets. SIAM J. Comput. 39(4): 1617-1636 (2009) - [j31]Yuval Rabani
Bicriteria approximation tradeoff for the node-cost budget problem. ACM Trans. Algorithms 5(2): 19:1-19:14 (2009) - [j30]Rafail Ostrovsky, Yuval Rabani
Error-correcting codes for automatic control. IEEE Trans. Inf. Theory 55(7): 2931-2941 (2009) - [c47]Yuval Rabani
Explicit construction of a small epsilon-net for linear threshold functions. STOC 2009: 649-658 - [i3]Zohar Shay Karnin, Yuval Rabani, Amir Shpilka:
Explicit Dimension Reduction and Its Applications. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c46]Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy:
Approximation algorithms for labeling hierarchical taxonomies. SODA 2008: 671-680 - [c45]Yuval Rabani, Gabriel Scalosub:
Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem. SWAT 2008: 90-101 - 2007
- [j29]Rafail Ostrovsky, Yuval Rabani
Low distortion embeddings for edit distance. J. ACM 54(5): 23 (2007) - [j28]Anna Moss, Yuval Rabani
Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems. SIAM J. Comput. 37(2): 460-481 (2007) - [r1]Yuval Rabani:
Linear Programming. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j27]Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani
On the Hardness of Approximating Multicut and Sparsest-Cut. Comput. Complex. 15(2): 94-114 (2006) - [j26]Julia Chuzhoy, Rafail Ostrovsky, Yuval Rabani
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems. Math. Oper. Res. 31(4): 730-738 (2006) - [c44]Michael Langberg, Yuval Rabani
Approximation Algorithms for Graph Homomorphism Problems. APPROX-RANDOM 2006: 176-187 - [c43]Rafail Ostrovsky, Yuval Rabani
The Effectiveness of Lloyd-Type Methods for the k-Means Problem. FOCS 2006: 165-176 - [c42]Sanjeev Arora, László Lovász, Ilan Newman, Yuval Rabani, Yuri Rabinovich, Santosh S. Vempala:
Local versus global properties of metric spaces. SODA 2006: 41-50 - [c41]Robert Krauthgamer, Yuval Rabani:
Improved lower bounds for embeddings into L1. SODA 2006: 1010-1017 - [c40]Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani
On earthmover distance, metric labeling, and 0-extension. STOC 2006: 547-556 - 2005
- [j25]Joseph Cheriyan, Howard J. Karloff, Yuval Rabani
Approximating Directed Multicuts. Comb. 25(3): 251-269 (2005) - [c39]Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani
On the Hardness of Approximating Multicut and Sparsest-Cut. CCC 2005: 144-153 - [c38]Rafail Ostrovsky, Yuval Rabani
Error-Correcting Codes for Automatic Control. FOCS 2005: 309-316 - [c37]Julia Chuzhoy, Yuval Rabani:
Approximating k-median with non-uniform capacities. SODA 2005: 952-958 - [c36]Rafail Ostrovsky, Yuval Rabani
Low distortion embeddings for edit distance. STOC 2005: 218-224 - [i2]Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani:
On earthmover distance, metric labeling, and 0-extension. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j24]T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani
Cell-probe lower bounds for the partial match problem. J. Comput. Syst. Sci. 69(3): 435-447 (2004) - [j23]Allan Borodin, Rafail Ostrovsky, Yuval Rabani
Stability Preserving Transformations: Packet Routing Networks with Edge Capacities and Speeds. J. Interconnect. Networks 5(1): 1-12 (2004) - [j22]Allan Borodin, Rafail Ostrovsky, Yuval Rabani
Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces. Mach. Learn. 56(1-3): 153-167 (2004) - [j21]Gruia Calinescu
Approximation Algorithms for the 0-Extension Problem. SIAM J. Comput. 34(2): 358-372 (2004) - [c35]Claire Kenyon, Yuval Rabani
Low distortion maps between point sets. STOC 2004: 272-280 - 2003
- [c34]Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani
Approximation schemes for clustering problems. STOC 2003: 50-58 - [c33]T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani
Cell-probe lower bounds for the partial match problem. STOC 2003: 667-672 - 2002
- [j20]Rafail Ostrovsky, Yuval Rabani
Polynomial-time approximation schemes for geometric min-sum median clustering. J. ACM 49(2): 139-156 (2002) - [j19]Omer Barkol, Yuval Rabani:
Tighter Lower Bounds for Nearest Neighbor Search and Related Problems in the Cell Probe Model. J. Comput. Syst. Sci. 64(4): 873-896 (2002) - [c32]Yuval Rabani:
Search and Classification of High Dimensional Data. APPROX 2002: 1-2 - [c31]Gruia Calinescu
Improved Approximation Algorithms for Resource Allocation. IPCO 2002: 401-414 - [i1]Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani:
Polynomial Time Approximation Schemes for Metric Min-Sum Clustering. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [j18]Jon M. Kleinberg, Yuval Rabani
Fairness in Routing and Load Balancing. J. Comput. Syst. Sci. 63(1): 2-20 (2001) - [c30]Joseph Cheriyan, Howard J. Karloff, Yuval Rabani
Approximating Directed Multicuts. FOCS 2001: 320-328 - [c29]Julia Chuzhoy, Rafail Ostrovsky, Yuval Rabani:
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems. FOCS 2001: 348-356 - [c28]Gruia Calinescu, Howard J. Karloff, Yuval Rabani:
Approximation algorithms for the 0-extension problem. SODA 2001: 8-16 - [c27]Joseph Naor, Yuval Rabani:
Tree packing and approximating k-cuts. SODA 2001: 26-27 - [c26]Allan Borodin, Rafail Ostrovsky, Yuval Rabani:
Stability preserving transformations: packet routing networks with edge capacities and speeds. SODA 2001: 601-610 - [c25]Anna Moss, Yuval Rabani
Approximation algorithms for constrained for constrained node weighted steiner tree problems. STOC 2001: 373-382 - 2000
- [j17]Gruia Calinescu, Howard J. Karloff, Yuval Rabani:
An Improved Approximation Algorithm for MULTIWAY CUT. J. Comput. Syst. Sci. 60(3): 564-574 (2000) - [j16]Jon M. Kleinberg, Yuval Rabani
Allocating Bandwidth for Bursty Connections. SIAM J. Comput. 30(1): 191-217 (2000) - [j15]Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. SIAM J. Comput. 30(2): 457-474 (2000) - [j14]Avrim Blum, Howard J. Karloff, Yuval Rabani
A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems. SIAM J. Comput. 30(5): 1624-1661 (2000) - [c24]Rafail Ostrovsky, Yuval Rabani
Polynomial Time Approximation Schemes for Geometric k-Clustering. FOCS 2000: 349-358 - [c23]Omer Barkol, Yuval Rabani
Tighter bounds for nearest neighbor search and related problems in the cell probe model. STOC 2000: 388-396
1990 – 1999
- 1999
- [c22]Jon M. Kleinberg, Yuval Rabani
Fairness in Routing and Load Balancing. FOCS 1999: 568-578 - [c21]Allan Borodin, Rafail Ostrovsky, Yuval Rabani
Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems. STOC 1999: 312-321 - [c20]Allan Borodin, Rafail Ostrovsky, Yuval Rabani
Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces. STOC 1999: 435-444 - 1998
- [j13]Claire Kenyon, Yuval Rabani
Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing. J. Algorithms 27(2): 218-235 (1998) - [j12]Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani
Fairness in Scheduling. J. Algorithms 29(2): 306-357 (1998) - [j11]Yuval Rabani, Yuri Rabinovich, Alistair Sinclair:
A computational view of population genetics. Random Struct. Algorithms 12(4): 313-334 (1998) - [j10]Yonatan Aumann, Yuval Rabani
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm. SIAM J. Comput. 27(1): 291-301 (1998) - [j9]Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani
Competitive Algorithms for Layered Graph Traversal. SIAM J. Comput. 28(2): 447-462 (1998) - [c19]Yuval Rabani
Local Divergence of Markov Chains and the Analysis of Iterative Load Balancing Schemes. FOCS 1998: 694-705 - [c18]Gruia Calinescu
An Improved Approximation Algorithm for Multiway Cut. STOC 1998: 48-52 - [c17]Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. STOC 1998: 614-623 - 1997
- [j8]Allan Borodin, Yuval Rabani
Deterministic Many-to-Many Hot Potato Routing. IEEE Trans. Parallel Distributed Syst. 8(6): 587-596 (1997) - [c16]Rafail Ostrovsky, Yuval Rabani
Universal O(Congestion + Dilation + log1+epsilonN) Local Control Packet Switching Algorithms. STOC 1997: 644-653 - [c15]Jon M. Kleinberg, Yuval Rabani
Allocating Bandwidth for Bursty Connections. STOC 1997: 664-673 - 1996
- [j7]Sandy Irani, Yuval Rabani
On the Value of Coordination in Distributed Decision Making. SIAM J. Comput. 25(3): 498-519 (1996) - [c14]Yuval Rabani
Path Coloring on the Mesh. FOCS 1996: 400-409 - [c13]Claire Kenyon, Yuval Rabani, Alistair Sinclair:
Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Preliminary Version). SODA 1996: 351-358 - [c12]Yuval Rabani
Distributed Packet Switching in Arbitrary Networks. STOC 1996: 366-375 - 1995
- [j6]Yair Bartal, Amos Fiat, Yuval Rabani
Competitive Algorithms for Distributed Data Management. J. Comput. Syst. Sci. 51(3): 341-358 (1995) - [c11]Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts:
Fairness in Scheduling. SODA 1995: 477-485 - [c10]Yonatan Aumann, Yuval Rabani:
Improved Bounds for All Optical Routing. SODA 1995: 567-576 - [c9]Yuval Rabani
A computational view of population genetics. STOC 1995: 83-92 - 1994
- [j5]Amos Fiat, Yuval Rabani
A Deterministic O(k³)-Competitive k-Server Algorithm for the Circle. Algorithmica 11(6): 572-578 (1994) - [j4]Yair Bartal, Howard J. Karloff, Yuval Rabani
A Better Lower Bound for On-Line Scheduling. Inf. Process. Lett. 50(3): 113-116 (1994) - [j3]Amos Fiat, Yuval Rabani
Competitive k-Server Algorithms. J. Comput. Syst. Sci. 48(3): 410-428 (1994) - [j2]Howard J. Karloff, Yuval Rabani
Lower Bounds for Randomized k-Server and Motion-Planning Algorithms. SIAM J. Comput. 23(2): 293-312 (1994) - [c8]Baruch Awerbuch, Rainer Gawlick, Frank Thomson Leighton, Yuval Rabani
On-line Admission Control and Circuit Routing for High Performance Computing and Communication. FOCS 1994: 412-423 - [c7]Sanjeev Arora, Yuval Rabani
Simulating quadratic dynamical systems is PSPACE-complete (preliminary version). STOC 1994: 459-467 - 1993
- [c6]Sandy Irani, Yuval Rabani
On the Value of Information in Coordination Games (preliminary version). FOCS 1993: 12-21 - 1992
- [j1]Yuval Rabani, Zvi Galil:
On the Space Complexity of Some Algorithms for Sequence Comparison. Theor. Comput. Sci. 95(2): 231-244 (1992) - [c5]Avrim Blum, Howard J. Karloff, Yuval Rabani
A Decomposition Theorem and Bounds for Randomized Server Problems. FOCS 1992: 197-207 - [c4]Yair Bartal, Amos Fiat, Yuval Rabani
Competitive Algorithms for Distributed Data Management (Extended Abstract). STOC 1992: 39-50 - 1991
- [c3]Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani
Competitive Algorithms for Layered Graph Traversal. FOCS 1991: 288-297 - [c2]Howard J. Karloff, Yuval Rabani
Lower Bounds for Randomized k-Server and Motion Planning Algorithms. STOC 1991: 278-288 - 1990
- [c1]Amos Fiat, Yuval Rabani
Competitive k-Server Algorithms (Extended Abstract). FOCS 1990: 454-463
Coauthor Index
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-10-07 21: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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: