Nimrod Megiddo

According to our database1, Nimrod Megiddo authored at least 118 papers between 1974 and 2019.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Carving Perfect Layers out of Docker Images.
Proceedings of the 11th USENIX Workshop on Hot Topics in Cloud Computing, 2019

2016
Strategic Classification.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

Adaptive Caching in Big SQL using the HDFS Cache.
Proceedings of the Seventh ACM Symposium on Cloud Computing, 2016

2014
Equilibrium Computation (Dagstuhl Seminar 14342).
Dagstuhl Reports, 2014

2013
Recommending targeted strangers from whom to solicit information on social media.
Proceedings of the 18th International Conference on Intelligent User Interfaces, 2013

2010
10171 Abstracts Collection - Equilibrium Computation.
Proceedings of the Equilibrium Computation, 25.04. - 30.04.2010, 2010

Formation of preferences and strategic analysis.
Proceedings of the Behavioral and Quantitative Game Theory, 2010

2008
Efficient Coalition Detection in Traitor Tracing.
Proceedings of The IFIP TC-11 23rd International Information Security Conference, 2008

Adaptive traitor tracing for large anonymous attack.
Proceedings of the 8th ACM Workshop on Digital Rights Management, 2008

Dynamic faceted search for discovery-driven analysis.
Proceedings of the 17th ACM Conference on Information and Knowledge Management, 2008

2007
Consistent selectivity estimation via maximum entropy.
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

Online Learning with Prior Knowledge.
Proceedings of the Learning Theory, 20th Annual Conference on Learning Theory, 2007

2006
Preface.
Theor. Comput. Sci., 2006

Combining expert advice in reactive environments.
J. ACM, 2006

MAXENT: consistent cardinality estimation in action.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2006

Integrating a Maximum-Entropy Cardinality Estimator into DB2 UDB.
Proceedings of the Advances in Database Technology, 2006

2005
Consistently Estimating the Selectivity of Conjuncts of Predicates.
Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30, 2005

2004
Linear programming.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Outperforming LRU with an Adaptive Replacement Cache Algorithm.
IEEE Computer, 2004

Exploration-Exploitation Tradeoffs for Experts Algorithms in Reactive Environments.
Proceedings of the Advances in Neural Information Processing Systems 17 [Neural Information Processing Systems, 2004

2003
One Up on LRU.
;login:, 2003

How to Combine Expert (and Novice) Advice when Actions Impact the Environment?
Proceedings of the Advances in Neural Information Processing Systems 16 [Neural Information Processing Systems, 2003

ARC: A Self-Tuning, Low Overhead Replacement Cache.
Proceedings of the FAST '03 Conference on File and Storage Technologies, March 31, 2003

2002
Automating physical database design in a parallel database.
Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, 2002

Attribute Classification Using Feature Analysis.
Proceedings of the 18th International Conference on Data Engineering, San Jose, CA, USA, February 26, 2002

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
An analytical model for loop tiling and its solution.
Proceedings of the 2000 IEEE International Symposium on Performance Analysis of Systems and Software, 2000

1999
Fast indexing method for multidimensional nearest-neighbor search.
Proceedings of the Storage and Retrieval for Image and Video Databases VII, 1999

1998
Using Fast Matrix Multiplication to Find Basic Solutions.
Theor. Comput. Sci., 1998

A modified layered-step interior-point algorithm for linear programming.
Math. Program., 1998

Discovering Predictive Association Rules.
Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD-98), 1998

Discovery-Driven Exploration of OLAP Data Cubes.
Proceedings of the Advances in Database Technology, 1998

1997
Optimal Weighted Loop Fusion for Parallel Programs.
Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997

Range Queries in OLAP Data Cubes.
Proceedings of the SIGMOD 1997, 1997

1996
A Deterministic Poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimensions.
SIAM J. Comput., 1996

A Linear Programming Instance with Many Crossover Events.
J. Complexity, 1996

on the Geometric Separability of Boolean Functions.
Discrete Applied Mathematics, 1996

Segmenting and representing background in color images.
Proceedings of the 13th International Conference on Pattern Recognition, 1996

Color image background segmentation and representation.
Proceedings of the Proceedings 1996 International Conference on Image Processing, 1996

1995
Improved Algorithms and Analysis for Secretary Problems and Generalizations.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994
Improved Algorithms for Linear Inequalities With Two Variables per Inequality.
SIAM J. Comput., 1994

Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time.
J. ACM, 1994

Fast algorithms for finding randomized strategies in game trees.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

A Sublinear Parallel Algorithm for Stable Matching.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

On Probabilistic Machines, Bounded Rationality and Average-Case Complexity.
Proceedings of the Essays in Game Theory, In Honor of Michael Maschler, 1994

1993
Linear time algorithms for some separable quadratic programming problems.
Oper. Res. Lett., 1993

A primal-dual infeasible-interior-point algorithm for linear programming.
Math. Program., 1993

Theoretical convergence of large-step primal-dual interior point algorithms for linear programming.
Math. Program., 1993

Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality.
Math. Program., 1993

A General Framework of Continuation Methods for Complementarity Problems.
Math. Oper. Res., 1993

Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Periodic Graphs.
J. ACM, 1993

Constructing small sample spaces satisfying given constraints.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

The Minimum Reservation Rate Problem in Digital Audio/Video Systems.
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

A Note on Approximate Linear Programming.
Inf. Process. Lett., 1992

A Deterministic Poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimension
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

New Algorithms for Generalized Network Flows.
Proceedings of the Theory of Computing and Systems, 1992

1991
On Total Functions, Existence Theorems and Computational Complexity.
Theor. Comput. Sci., 1991

A unified approach to interior point algorithms for linear complementarity problems: A summary.
Oper. Res. Lett., 1991

Homotopy Continuation Methods for Nonlinear Complementarity Problems.
Math. Oper. Res., 1991

Exact Computation of Optimal Inventory Policies Over an Unbounded Horizon.
Math. Oper. Res., 1991

On Finding Primal- and Dual-Optimal Bases.
INFORMS Journal on Computing, 1991

Approximation algorithms for hitting objects with straight lines.
Discrete Applied Mathematics, 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

Algorithms and Complexity Analysis for Some Flow Problems.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
Lecture Notes in Computer Science 538, Springer, ISBN: 3-540-54509-3, 1991

1990
Linear Programming with Two Variables per Inequality in Poly-Log Time.
SIAM J. Comput., 1990

On the Complexity of Some Geometric Problems in Unbounded Dimension.
J. Symb. Comput., 1990

Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

Recognizing Properties of Periodic Graphs.
Proceedings of the Applied Geometry And Discrete Mathematics, 1990

1989
Boundary Behavior of Interior Point Algorithms in Linear Programming.
Math. Oper. Res., 1989

On the Ball Spanned by Balls.
Discrete & Computational Geometry, 1989

Extending NC and RNC Algorithms.
Algorithmica, 1989

Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Dynamic Graphs (Preliminary Version)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

1988
On Finding a Minimum Dominating Set in a Tournament.
Theor. Comput. Sci., 1988

The complexity of searching a graph.
J. ACM, 1988

On the Complexity of Polyhedral Separability.
Discrete & Computational Geometry, 1988

A Logic for Reasoning about Probabilities
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

1986
A note on degeneracy in linear programming.
Math. Program., 1986

On the expected number of linear complementarity cones intersected by random and semi-random rays.
Math. Program., 1986

Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm.
Math. Program., 1986

An O(n log n) Randomizing Algorithm for the Weighted Euclidean 1-Center Problem.
J. Algorithms, 1986

Introduction: New Approaches to Linear Programming.
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 Poly-Log Time (Preliminary Version)
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

1985
A Two-Resource Allocation Problem Solvable in Linear Time.
Math. Oper. Res., 1985

Optimal precision in the presence of uncertainty.
J. Complexity, 1985

Partitioning with Two Lines in the Plane.
J. Algorithms, 1985

An Optimal Algorithm for Finding all the Jumps of a Monotone Step-Function.
J. Algorithms, 1985

Optimal Precision in the Presence of Uncertainty (Preliminary Version)
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

1984
On the Complexity of Some Common Geometric Location Problems.
SIAM J. Comput., 1984

Linear Programming in Linear Time When the Dimension Is Fixed.
J. ACM, 1984

A Simplex Algorithm Whose Average Number of Steps is Bounded between Two Quadratic Functions of the Smaller Dimension
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1983
New Results on the Complexity of p-Center Problems.
SIAM J. Comput., 1983

Linear-Time Algorithms for Linear Programming in R3 and Related Problems.
SIAM J. Comput., 1983

Towards a Genuinely Polynomial Algorithm for Linear Programming.
SIAM J. Comput., 1983

The Weighted Euclidean 1-Center Problem.
Math. Oper. Res., 1983

1982
Is Binary Encoding Appropriate for the Problem-Language Relationship?
Theor. Comput. Sci., 1982

On the complexity of locating linear facilities in the plane.
Oper. Res. Lett., 1982

On the complexity of the one-terminal network design problem.
Oper. Res. Lett., 1982

Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

1981
An O(n log2 n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems.
SIAM J. Comput., 1981

The Complexity of Searching a Graph (Preliminary Version)
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1979
On Fulkerson's Conjecture About Consistent Labeling Processes.
Math. Oper. Res., 1979

Combinatorial Optimization with Rational Objective Functions.
Math. Oper. Res., 1979

A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort.
J. ACM, 1979

1978
An O(N log N) Algorithm for a Class of Matching Problems.
SIAM J. Comput., 1978

Cost allocation for steiner trees.
Networks, 1978

Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree.
Math. Oper. Res., 1978

Combinatorial Optimization with Rational Objective Functions
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978

1977
Cyclic Ordering is NP-Complete.
Theor. Comput. Sci., 1977

On the existence and uniqueness of solutions in nonlinear complementarity theory.
Math. Program., 1977

A monotone complementarity problem with feasible solutions but no complementary solutions.
Math. Program., 1977

On monotonicity in parametric linear complementarity problems.
Math. Program., 1977

Mixtures of order matrices and generalized order matrices.
Discrete Mathematics, 1977

1974
Optimal flows in networks with multiple sources and sinks.
Math. Program., 1974


  Loading...