Nimrod Megiddo
According to our database^{1},
Nimrod Megiddo
authored at least 118 papers
between 1974 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on zbmath.org

on id.loc.gov

on dnb.info

on isni.org

on dl.acm.org
On csauthors.net:
Bibliography
2020
CoRR, 2020
2019
Proceedings of the 11th USENIX Workshop on Hot Topics in Cloud Computing, 2019
2016
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016
Proceedings of the Seventh ACM Symposium on Cloud Computing, 2016
2014
Dagstuhl Reports, 2014
CoRR, 2014
2013
Proceedings of the 18th International Conference on Intelligent User Interfaces, 2013
2010
Proceedings of the Equilibrium Computation, 25.04.  30.04.2010, 2010
Proceedings of the Behavioral and Quantitative Game Theory, 2010
2008
Proceedings of The IFIP TC11 23rd International Information Security Conference, 2008
Proceedings of the 8th ACM Workshop on Digital Rights Management, 2008
Proceedings of the 17th ACM Conference on Information and Knowledge Management, 2008
2007
VLDB J., 2007
Continuity Properties of Equilibrium Prices and Allocations in Linear Fisher Markets.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007
Proceedings of the Learning Theory, 20th Annual Conference on Learning Theory, 2007
2006
Theor. Comput. Sci., 2006
J. ACM, 2006
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2006
Proceedings of the Advances in Database Technology, 2006
2005
Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30, 2005
2004
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004
Computer, 2004
ExplorationExploitation Tradeoffs for Experts Algorithms in Reactive Environments.
Proceedings of the Advances in Neural Information Processing Systems 17 [Neural Information Processing Systems, 2004
2003
login Usenix Mag., 2003
Proceedings of the Advances in Neural Information Processing Systems 16 [Neural Information Processing Systems, 2003
Proceedings of the FAST '03 Conference on File and Storage Technologies, March 31, 2003
2002
Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, 2002
Proceedings of the 18th International Conference on Data Engineering, San Jose, CA, USA, February 26, 2002
2001
SIAM J. Discret. Math., 2001
An Improved Predictive Accuracy Bound for Averaging Classifiers.
Proceedings of the Eighteenth International Conference on Machine Learning (ICML 2001), Williams College, Williamstown, MA, USA, June 28, 2001
2000
Theor. Comput. Sci., 2000
Proceedings of the 2000 IEEE International Symposium on Performance Analysis of Systems and Software, 2000
1999
Proceedings of the Storage and Retrieval for Image and Video Databases VII, 1999
1998
Theor. Comput. Sci., 1998
Math. Program., 1998
Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD98), 1998
Proceedings of the Advances in Database Technology, 1998
1997
Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997
Proceedings of the SIGMOD 1997, 1997
1996
A Deterministic Poly(log log N)Time NProcessor Algorithm for Linear Programming in Fixed Dimensions.
SIAM J. Comput., 1996
J. Complex., 1996
Discret. Appl. Math., 1996
Proceedings of the 13th International Conference on Pattern Recognition, 1996
Proceedings of the Proceedings 1996 International Conference on Image Processing, 1996
1994
SIAM J. Discret. Math., 1994
SIAM J. Comput., 1994
Math. Program., 1994
J. ACM, 1994
Algorithmica, 1994
Proceedings of the TwentySixth Annual ACM Symposium on Theory of Computing, 1994
Proceedings of the Essays in Game Theory, In Honor of Michael Maschler, 1994
1993
Oper. Res. Lett., 1993
Math. Program., 1993
Theoretical convergence of largestep primaldual interior point algorithms for linear programming.
Math. Program., 1993
Tight bounds and 2approximation algorithms for integer programs with two variables per inequality.
Math. Program., 1993
Math. Oper. Res., 1993
Strongly PolynomialTime and NC Algorithms for Detecting Cycles in Periodic Graphs.
J. ACM, 1993
Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993
1992
An interior point potential reduction algorithm for the linear complementarity problem.
Math. Program., 1992
Inf. Process. Lett., 1992
A Deterministic Poly(log log N)Time NProcessor Algorithm for Linear Programming in Fixed Dimension
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992
1991
Theor. Comput. Sci., 1991
A unified approach to interior point algorithms for linear complementarity problems: A summary.
Oper. Res. Lett., 1991
Math. Oper. Res., 1991
Math. Oper. Res., 1991
INFORMS J. Comput., 1991
Discret. Appl. Math., 1991
Improved Algorithms for Linear Inequalities with Two Variables per Inequality (Extended Abstract)
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
Lecture Notes in Computer Science 538, Springer, ISBN: 3540545093, 1991
1990
SIAM J. Comput., 1990
J. Symb. Comput., 1990
Inf. Comput., 1990
Proceedings of the Applied Geometry And Discrete Mathematics, 1990
1989
Math. Oper. Res., 1989
Discret. Comput. Geom., 1989
Algorithmica, 1989
Strongly PolynomialTime and NC Algorithms for Detecting Cycles in Dynamic Graphs (Preliminary Version)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989
1988
Theor. Comput. Sci., 1988
J. ACM, 1988
Discret. Comput. Geom., 1988
1986
Math. Program., 1986
On the expected number of linear complementarity cones intersected by random and semirandom rays.
Math. Program., 1986
Improved asymptotic analysis of the average number of steps performed by the selfdual simplex algorithm.
Math. Program., 1986
J. Algorithms, 1986
Algorithmica, 1986
On Play by Means of Computing Machines.
Proceedings of the 1st Conference on Theoretical Aspects of Reasoning about Knowledge, 1986
Linear Programming with Two Variables per Inequality in PolyLog Time (Preliminary Version)
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986
1985
A Simplex Algorithm Whose Average Number of Steps Is Bounded between Two Quadratic Functions of the Smaller Dimension
J. ACM, October, 1985
Math. Oper. Res., 1985
J. Complex., 1985
J. Algorithms, 1985
J. Algorithms, 1985
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985
1984
SIAM J. Comput., 1984
J. ACM, 1984
1983
J. ACM, October, 1983
SIAM J. Comput., 1983
LinearTime Algorithms for Linear Programming in R<sup>3</sup> and Related Problems.
SIAM J. Comput., 1983
SIAM J. Comput., 1983
Math. Oper. Res., 1983
1982
Theor. Comput. Sci., 1982
Oper. Res. Lett., 1982
Oper. Res. Lett., 1982
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982
1981
An O(n log<sup>2</sup> n) Algorithm for the kth Longest Path in a Tree with Applications to Location Problems.
SIAM J. Comput., 1981
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981
1979
Math. Oper. Res., 1979
Math. Oper. Res., 1979
J. ACM, 1979
1978
SIAM J. Comput., 1978
Networks, 1978
Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree.
Math. Oper. Res., 1978
1977
Theor. Comput. Sci., 1977
Math. Program., 1977
A monotone complementarity problem with feasible solutions but no complementary solutions.
Math. Program., 1977
Math. Program., 1977
Discret. Math., 1977
1974
Math. Program., 1974