Yossi Azar
Orcid: 0000-0002-5097-8993Affiliations:
- Tel Aviv University, Israel
According to our database1,
Yossi Azar
authored at least 184 papers
between 1986 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
2023
ACM Trans. Parallel Comput., December, 2023
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
2022
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022
2021
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021
2020
Beyond Tree Embeddings - a Deterministic Framework for Network Design with Deadlines or Delay.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020
Proceedings of the 28th Annual European Symposium on Algorithms, 2020
Proceedings of the Conference on Learning Theory, 2020
2019
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019
2018
2-Approximation algorithm for a generalization of scheduling on unrelated parallel machines.
Inf. Process. Lett., 2018
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018
2017
Algorithmica, 2017
Proceedings of the Web and Internet Economics - 13th International Conference, 2017
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017
Proceedings of the Approximation, 2017
2016
Polylogarithmic Bounds on the Competitiveness of Min-cost (Bipartite) Perfect Matching with Delays.
CoRR, 2016
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016
2015
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015
Proceedings of the Algorithms - ESA 2015, 2015
2014
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014
Proceedings of the Innovations in Theoretical Computer Science, 2014
2013
Proceedings of the Symposium on Theory of Computing Conference, 2013
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
2012
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012
2011
Theor. Comput. Sci., 2011
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011
Proceedings of the Algorithms - ESA 2011, 2011
2010
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010
2009
ACM Trans. Algorithms, 2009
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009
Proceedings of the Algorithms, 2009
2008
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008
Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), 2008
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008
2007
Theory Comput. Syst., 2007
Algorithmica, 2007
2006
Theor. Comput. Sci., 2006
Theor. Comput. Sci., 2006
ACM Trans. Algorithms, 2006
Proceedings of the Algorithm Theory, 2006
2005
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005
Proceedings of the Algorithms, 2005
2004
SIAM J. Discret. Math., 2004
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004
Proceedings of the Algorithm Theory, 2004
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004
2003
Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms.
J. Sched., 2003
Inf. Process. Lett., 2003
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003
2002
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002
2001
J. Comput. Syst. Sci., 2001
Algorithmica, 2001
Algorithmica, 2001
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001
Proceedings of the Networked Group Communication, 2001
Proceedings of the Integer Programming and Combinatorial Optimization, 2001
2000
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000
1999
Proceedings of the Randomization, 1999
1998
New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen.
SIAM J. Comput., 1998
Algorithmica, 1998
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 1998
1997
On-line routing of virtual circuits with applications to load balancing and machine scheduling.
J. ACM, 1997
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997
1996
Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (Extended Abstract).
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996
Packet Routing via Min-Cost Circuit Routing.
Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996
Proceedings of the Algorithms, 1996
1995
Improved approximation guarantees for minimum-weight <i>k</i>-trees and prize-collecting salesmen.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995
1994
Inf. Process. Lett., 1994
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994
Local Optimization of Global Objectives: Competitive Distributed Deadlock Resolution and Resource Allocation
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994
1993
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993
On-line load balancing with applications to machine scheduling and virtual circuit routing.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993
1992
SIAM J. Comput., 1992
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992
1991
1990
1989
1988
The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms.
SIAM J. Comput., 1988
1987
1986
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986