Joseph Naor
Affiliations:- Technion - Israel Institute of Technology, Haifa, Israel
According to our database1,
Joseph Naor
authored at least 199 papers
between 1983 and 2024.
Collaborative distances:
Collaborative distances:
Awards
ACM Fellow
ACM Fellow 2023, "For contributions to online, randomized, and approximation algorithms".
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on viaf.org
-
on id.loc.gov
On csauthors.net:
Bibliography
2024
Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
2023
Math. Program., February, 2023
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
2022
J. Comput. Syst. Sci., 2022
Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022
2021
ACM Trans. Economics and Comput., 2021
Proc. ACM Meas. Anal. Comput. Syst., 2021
INFORMS J. Comput., 2021
CoRR, 2021
Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021
Proceedings of the SIGMETRICS '21: ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2021
Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N: M Transposable Masks.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021
Recent Advances in Competitive Analysis of Online Algorithms.
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021
Proceedings of the Approximation, 2021
2020
A (1-e<sup>-1</sup>-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020
Proceedings of the 20th IEEE/ACM International Symposium on Cluster, 2020
2019
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
2018
ACM Trans. Economics and Comput., 2018
SIAM J. Comput., 2018
Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018
Proceedings of the 4th IEEE Conference on Network Softwarization and Workshops, 2018
Proceedings of the ACM Symposium on Cloud Computing, 2018
2017
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
2016
Math. Oper. Res., 2016
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016
2015
Near-Optimal Scheduling Mechanisms for Deadline-Sensitive Jobs in Large Computing Clusters.
ACM Trans. Parallel Comput., 2015
SIAM J. Comput., 2015
J. ACM, 2015
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015
2014
IEEE Syst. J., 2014
Theory Comput. Syst., 2014
Algorithmica, 2014
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
Proceedings of the 2014 IEEE Conference on Computer Communications, 2014
Proceedings of the Algorithms - ESA 2014, 2014
2013
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013
2012
IEEE/ACM Trans. Netw., 2012
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012
Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012
2011
Proceedings of the IEEE Second International Conference on Smart Grid Communications, 2011
Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm - (Extended Abstract).
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
Proceedings of the Algorithms - ESA 2011, 2011
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011
2010
J. Discrete Algorithms, 2010
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010
2009
ACM Trans. Algorithms, 2009
Found. Trends Theor. Comput. Sci., 2009
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009
2008
Theory Comput. Syst., 2008
The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms.
Discret. Appl. Math., 2008
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008
2007
IEEE J. Sel. Areas Commun., 2007
Proceedings of the 8th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2007
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007
Proceedings of the Algorithms, 2007
An <i>O</i> (log<sup>2</sup> <i>k</i> )-Competitive Algorithm for Metric Bipartite Matching.
Proceedings of the Algorithms, 2007
2006
IEEE/ACM Trans. Netw., 2006
ACM Trans. Algorithms, 2006
Efficient algorithms for shared backup allocation in networks with partial information.
J. Comb. Optim., 2006
J. ACM, 2006
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006
2005
J. ACM, 2005
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005
Proceedings of the Algorithms, 2005
Proceedings of the Algorithms, 2005
2004
IEEE/ACM Trans. Netw., 2004
A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem.
SIAM J. Discret. Math., 2004
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004
2003
Electron. Colloquium Comput. Complex., 2003
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003
2002
IEEE/ACM Trans. Netw., 2002
Math. Oper. Res., 2002
Proceedings of the Proceedings IEEE INFOCOM 2002, 2002
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002
2001
SIAM J. Comput., 2001
SIAM J. Comput., 2001
Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems.
J. Graph Algorithms Appl., 2001
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
Approximation algorithms for the metric labeling problem via a new linear programming formulation.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
2000
SIAM J. Discret. Math., 2000
SIAM J. Comput., 2000
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000
Dynamic session management for static and mobile users: a competitive on-line algorithmic approach.
Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2000), 2000
1999
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999
Proceedings of the Algorithms, 1999
1998
Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference.
SIAM J. Comput., 1998
Algorithmica, 1998
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998
1997
Spreading Metric Based Graph Partitioning Algorithms.
Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, 1997
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997
1996
J. Algorithms, 1996
1995
Random Struct. Algorithms, 1995
Proceedings of the Integer Programming and Combinatorial Optimization, 1995
Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract).
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995
1994
Simple and Fast Algorithms for Linear and Integer Programs With Two Variables per Inequality.
SIAM J. Comput., 1994
J. Comput. Syst. Sci., 1994
Approximation Algorithms for the Vertex Feedback Set Problem with Applications to Constraint Satisfaction and Bayesian Inference.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994
1993
SIAM J. Comput., 1993
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality.
Math. Program., 1993
1992
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs.
IEEE Trans. Inf. Theory, 1992
1991
An Efficient Parallel Algorithm for Computing a Large Independent Set in Planar Graph.
Algorithmica, 1991
1990
SIAM J. Discret. Math., 1990
J. Algorithms, 1990
1989
Using Bounded Degree Spanning Trees in the Design of Efficient Algorithms on Claw-Free Graphs.
Proceedings of the Algorithms and Data Structures, 1989
An Efficient Parallel Algorithm for Computing a Large Independent Set in a Plan Graph.
Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989
1988
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988
1987
אלגוריתמים במערכות מקביליות ומבוזרות (Algorithms in distributed and parallel systems.).
PhD thesis, 1987
Inf. Process. Lett., 1987
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987
1984
IEEE Trans. Pattern Anal. Mach. Intell., 1984
1983
Pattern Recognit. Lett., 1983
Image Compression and Filtering Using Pyramid Data Structures.
Proceedings of the 8th International Joint Conference on Artificial Intelligence. Karlsruhe, 1983