default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNimrod Megiddo
Person information
- affiliation: Stanford University, USA
- award (2014): John von Neumann Theory Prize
- award (1992): Frederick W. Lanchester Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[i12]Nimrod Megiddo:
Remarks on Utility in Repeated Bets. CoRR abs/2306.03842 (2023)- [i11]Nimrod Megiddo:
On the Use of Generative Models in Observational Causal Analysis. CoRR abs/2306.04792 (2023) - [i10]Nimrod Megiddo:
On "Indifference" and Backward Induction in Games with Perfect Information. CoRR abs/2307.04029 (2023) - [i9]Elad Hazan, Nimrod Megiddo:
An Efficient Interior-Point Method for Online Convex Optimization. CoRR abs/2307.11668 (2023) - 2022
- [c50]Vito Paolo Pastore
, Nimrod Megiddo, Simone Bianco:
An Anomaly Detection Approach for Plankton Species Discovery. ICIAP (2) 2022: 599-609 - [i8]Kenneth L. Clarkson, Cristina Cornelio, Sanjeeb Dash, Joao Goncalves, Lior Horesh, Nimrod Megiddo:
Bayesian Experimental Design for Symbolic Discovery. CoRR abs/2211.15860 (2022) - 2021
- [i7]Cristina Cornelio, Sanjeeb Dash, Vernon Austel, Tyler R. Josephson, Joao Goncalves, Kenneth L. Clarkson, Nimrod Megiddo, Bachir El Khadir, Lior Horesh:
Integration of Data and Theory for Accelerated Derivable Symbolic Discovery. CoRR abs/2109.01634 (2021) - 2020
- [i6]Vernon Austel, Cristina Cornelio, Sanjeeb Dash, Joao Goncalves, Lior Horesh, Tyler R. Josephson, Nimrod Megiddo:
Symbolic Regression using Mixed-Integer Nonlinear Optimization. CoRR abs/2006.06813 (2020)
2010 – 2019
- 2019
- [c49]Dimitris Skourtis, Lukas Rupprecht, Vasily Tarasov, Nimrod Megiddo:
Carving Perfect Layers out of Docker Images. HotCloud 2019 - 2016
- [c48]Avrilia Floratou, Nimrod Megiddo, Navneet Potti, Fatma Özcan, Uday Kale, Jan Schmitz-Hermes:
Adaptive Caching in Big SQL using the HDFS Cache. SoCC 2016: 321-333 - [c47]Moritz Hardt, Nimrod Megiddo, Christos H. Papadimitriou, Mary Wootters:
Strategic Classification. ITCS 2016: 111-122 - 2015
- [i5]Moritz Hardt, Nimrod Megiddo, Christos H. Papadimitriou, Mary Wootters:
Strategic Classification. CoRR abs/1506.06980 (2015) - 2014
- [i4]Jalal Mahmud, Michelle X. Zhou, Nimrod Megiddo, Jeffrey Nichols, Clemens Drews:
Optimizing The Selection of Strangers To Answer Questions in Social Media. CoRR abs/1404.2013 (2014) - [i3]Jalal Mahmud, Michelle X. Zhou, Nimrod Megiddo, Jeffrey Nichols, Clemens Drews:
Recommending Targeted Strangers from Whom to Solicit Information on Social Media. CoRR abs/1405.5574 (2014) - [i2]Nimrod Megiddo, Kurt Mehlhorn, Rahul Savani, Vijay V. Vazirani:
Equilibrium Computation (Dagstuhl Seminar 14342). Dagstuhl Reports 4(8): 73-88 (2014) - 2013
- [c46]Jalal Mahmud, Michelle X. Zhou, Nimrod Megiddo, Jeffrey Nichols, Clemens Drews:
Recommending targeted strangers from whom to solicit information on social media. IUI 2013: 37-48 - 2010
- [c45]Nimrod Megiddo:
Formation of preferences and strategic analysis. BQGT 2010: 70:1 - [e3]Edith Elkind, Nimrod Megiddo, Peter Bro Miltersen, Vijay V. Vazirani, Bernhard von Stengel:
Equilibrium Computation, 25.04. - 30.04.2010. Dagstuhl Seminar Proceedings 10171, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i1]Edith Elkind, Nimrod Megiddo, Peter Bro Miltersen, Bernhard von Stengel, Vijay V. Vazirani:
10171 Abstracts Collection - Equilibrium Computation. Equilibrium Computation 2010
2000 – 2009
- 2008
- [c44]Debabrata Dash, Jun Rao, Nimrod Megiddo, Anastasia Ailamaki, Guy M. Lohman:
Dynamic faceted search for discovery-driven analysis. CIKM 2008: 3-12 - [c43]Hongxia Jin, Jeffrey B. Lotspiech, Michael J. Nelson, Nimrod Megiddo:
Adaptive traitor tracing for large anonymous attack. Digital Rights Management Workshop 2008: 1-8 - [c42]Hongxia Jin, Jeffery Lotspiech, Nimrod Megiddo:
Efficient Coalition Detection in Traitor Tracing. SEC 2008: 365-380 - 2007
- [j73]Volker Markl, Peter J. Haas, Marcel Kutsch, Nimrod Megiddo, Utkarsh Srivastava, Tam Minh Tran:
Consistent selectivity estimation via maximum entropy. VLDB J. 16(1): 55-76 (2007) - [c41]Elad Hazan, Nimrod Megiddo:
Online Learning with Prior Knowledge. COLT 2007: 499-513 - [c40]Nimrod Megiddo, Vijay V. Vazirani:
Continuity Properties of Equilibrium Prices and Allocations in Linear Fisher Markets. WINE 2007: 362-367 - 2006
- [j72]Daniela Pucci de Farias, Nimrod Megiddo:
Combining expert advice in reactive environments. J. ACM 53(5): 762-799 (2006) - [j71]Nimrod Megiddo, Yinfeng Xu, Binhai Zhu:
Preface. Theor. Comput. Sci. 363(3): 247 (2006) - [c39]Marcel Kutsch, Peter J. Haas, Volker Markl, Nimrod Megiddo, Tam Minh Tran:
Integrating a Maximum-Entropy Cardinality Estimator into DB2 UDB. EDBT 2006: 1092-1096 - [c38]Volker Markl, Marcel Kutsch, Tam Minh Tran, Peter J. Haas, Nimrod Megiddo:
MAXENT: consistent cardinality estimation in action. SIGMOD Conference 2006: 775-777 - 2005
- [c37]Volker Markl, Nimrod Megiddo, Marcel Kutsch, Tam Minh Tran, Peter J. Haas, Utkarsh Srivastava:
Consistently Estimating the Selectivity of Conjuncts of Predicates. VLDB 2005: 373-384 - [e2]Nimrod Megiddo, Yinfeng Xu, Binhai Zhu:
Algorithmic Applications in Management, First International Conference, AAIM 2005, Xian, China, June 22-25, 2005, Proceedings. Lecture Notes in Computer Science 3521, Springer 2005, ISBN 3-540-26224-5 [contents] - 2004
- [j70]Nimrod Megiddo, Dharmendra S. Modha:
Outperforming LRU with an Adaptive Replacement Cache Algorithm. Computer 37(4): 58-65 (2004) - [c36]Daniela Pucci de Farias, Nimrod Megiddo:
Exploration-Exploitation Tradeoffs for Experts Algorithms in Reactive Environments. NIPS 2004: 409-416 - [r1]Martin E. Dyer, Nimrod Megiddo, Emo Welzl:
Linear programming. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 999-1014 - 2003
- [j69]Nimrod Megiddo, Dharmendra S. Modha:
One Up on LRU. login Usenix Mag. 28(4) (2003) - [c35]Nimrod Megiddo, Dharmendra S. Modha:
ARC: A Self-Tuning, Low Overhead Replacement Cache. FAST 2003 - [c34]Daniela Pucci de Farias, Nimrod Megiddo:
How to Combine Expert (and Novice) Advice when Actions Impact the Environment? NIPS 2003: 815-822 - 2002
- [c33]Felix Naumann, Ching-Tien Ho, Xuqing Tian, Laura M. Haas, Nimrod Megiddo:
Attribute Classification Using Feature Analysis. ICDE 2002: 271 - [c32]Jun Rao, Chun Zhang, Nimrod Megiddo, Guy M. Lohman:
Automating physical database design in a parallel database. SIGMOD Conference 2002: 558-569 - 2001
- [j68]Miklós Ajtai, Nimrod Megiddo, Orli Waarts:
Improved Algorithms and Analysis for Secretary Problems and Generalizations. SIAM J. Discret. Math. 14(1): 1-27 (2001) - [c31]John Langford, Matthias W. Seeger, Nimrod Megiddo:
An Improved Predictive Accuracy Bound for Averaging Classifiers. ICML 2001: 290-297 - 2000
- [j67]Tomás Feder, Nimrod Megiddo, Serge A. Plotkin:
A sublinear parallel algorithm for stable matching. Theor. Comput. Sci. 233(1-2): 297-308 (2000) - [c30]Vivek Sarkar, Nimrod Megiddo:
An analytical model for loop tiling and its solution. ISPASS 2000: 146-153
1990 – 1999
- 1999
- [c29]John A. Shepherd, Xiaoming Zhu, Nimrod Megiddo:
Fast indexing method for multidimensional nearest-neighbor search. Storage and Retrieval for Image and Video Databases (SPIE) 1999: 350-355 - 1998
- [j66]Nimrod Megiddo, Shinji Mizuno, Takashi Tsuchiya:
A modified layered-step interior-point algorithm for linear programming. Math. Program. 82: 339-355 (1998) - [j65]Peter A. Beling, Nimrod Megiddo:
Using Fast Matrix Multiplication to Find Basic Solutions. Theor. Comput. Sci. 205(1-2): 307-316 (1998) - [c28]Sunita Sarawagi, Rakesh Agrawal, Nimrod Megiddo:
Discovery-Driven Exploration of OLAP Data Cubes. EDBT 1998: 168-182 - [c27]Nimrod Megiddo, Ramakrishnan Srikant:
Discovering Predictive Association Rules. KDD 1998: 274-278 - 1997
- [c26]Ching-Tien Ho, Rakesh Agrawal, Nimrod Megiddo, Ramakrishnan Srikant:
Range Queries in OLAP Data Cubes. SIGMOD Conference 1997: 73-88 - [c25]Nimrod Megiddo, Vivek Sarkar:
Optimal Weighted Loop Fusion for Parallel Programs. SPAA 1997: 282-291 - 1996
- [j64]Tibor Hegedüs, Nimrod Megiddo:
on the Geometric Separability of Boolean Functions. Discret. Appl. Math. 66(3): 205-218 (1996) - [j63]Shinji Mizuno, Nimrod Megiddo, Takashi Tsuchiya:
A Linear Programming Instance with Many Crossover Events. J. Complex. 12(4): 474-479 (1996) - [j62]Miklós Ajtai, Nimrod Megiddo:
A Deterministic Poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimensions. SIAM J. Comput. 25(6): 1171-1195 (1996) - [c24]Qian Huang, Nimrod Megiddo:
Color image background segmentation and representation. ICIP (3) 1996: 1027-1030 - [c23]Qian Huang, Byron Dom, Nimrod Megiddo, Wayne Niblack:
Segmenting and representing background in color images. ICPR 1996: 13-17 - 1995
- [c22]Miklós Ajtai, Nimrod Megiddo, Orli Waarts:
Improved Algorithms and Analysis for Secretary Problems and Generalizations. FOCS 1995: 473-482 - 1994
- [j61]Edith Cohen, Nimrod Megiddo:
Algorithms and Complexity Analysis for Some Flow Problems. Algorithmica 11(3): 320-340 (1994) - [j60]Noga Alon, Nimrod Megiddo:
Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time. J. ACM 41(2): 422-434 (1994) - [j59]Edith Cohen, Nimrod Megiddo:
New algorithms for generalized network flows. Math. Program. 64: 325-336 (1994) - [j58]Edith Cohen, Nimrod Megiddo:
Improved Algorithms for Linear Inequalities With Two Variables per Inequality. SIAM J. Comput. 23(6): 1313-1347 (1994) - [j57]Daphne Koller, Nimrod Megiddo:
Constructing Small Sample Spaces Satisfying Given Constraints. SIAM J. Discret. Math. 7(2): 260-274 (1994) - [c21]Nimrod Megiddo:
On Probabilistic Machines, Bounded Rationality and Average-Case Complexity. Essays in Game Theory 1994: 123-128 - [c20]Tomás Feder, Nimrod Megiddo, Serge A. Plotkin:
A Sublinear Parallel Algorithm for Stable Matching. SODA 1994: 632-637 - [c19]Daphne Koller, Nimrod Megiddo, Bernhard von Stengel:
Fast algorithms for finding randomized strategies in game trees. STOC 1994: 750-759 - [e1]Nimrod Megiddo:
Essays in Game Theory, In Honor of Michael Maschler. Springer 1994, ISBN 978-1-4612-7621-0 [contents] - 1993
- [j56]Edith Cohen, Nimrod Megiddo:
Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Periodic Graphs. J. ACM 40(4): 791-830 (1993) - [j55]Masakazu Kojima, Nimrod Megiddo, Shinji Mizuno:
A General Framework of Continuation Methods for Complementarity Problems. Math. Oper. Res. 18(4): 945-963 (1993) - [j54]Masakazu Kojima, Nimrod Megiddo, Shinji Mizuno:
Theoretical convergence of large-step primal-dual interior point algorithms for linear programming. Math. Program. 59: 1-21 (1993) - [j53]Masakazu Kojima, Nimrod Megiddo, Shinji Mizuno:
A primal-dual infeasible-interior-point algorithm for linear programming. Math. Program. 61: 263-280 (1993) - [j52]Dorit S. Hochbaum, Nimrod Megiddo, Joseph Naor, Arie Tamir:
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. Math. Program. 62: 69-83 (1993) - [j51]Nimrod Megiddo, Arie Tamir:
Linear time algorithms for some separable quadratic programming problems. Oper. Res. Lett. 13(4): 203-211 (1993) - [c18]Nimrod Megiddo, Moni Naor, David P. Anderson:
The Minimum Reservation Rate Problem in Digital Audio/Video Systems. ISTCS 1993: 43-48 - [c17]Daphne Koller, Nimrod Megiddo:
Constructing small sample spaces satisfying given constraints. STOC 1993: 268-277 - 1992
- [j50]Nimrod Megiddo:
A Note on Approximate Linear Programming. Inf. Process. Lett. 42(1): 53 (1992) - [j49]Masakazu Kojima, Nimrod Megiddo, Yinyu Ye:
An interior point potential reduction algorithm for the linear complementarity problem. Math. Program. 54: 267-279 (1992) - [c16]Edith Cohen, Nimrod Megiddo:
New Algorithms for Generalized Network Flows. ISTCS 1992: 103-114 - [c15]Miklós Ajtai, Nimrod Megiddo:
A Deterministic Poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimension. STOC 1992: 327-338 - 1991
- [b1]Masakazu Kojima, Nimrod Megiddo, Toshihito Noma, Akiko Yoshise:
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems. Lecture Notes in Computer Science 538, Springer 1991, ISBN 3-540-54509-3 - [j48]Refael Hassin, Nimrod Megiddo:
Approximation algorithms for hitting objects with straight lines. Discret. Appl. Math. 30(1): 29-42 (1991) - [j47]Nimrod Megiddo:
On Finding Primal- and Dual-Optimal Bases. INFORMS J. Comput. 3(1): 63-65 (1991) - [j46]Refael Hassin, Nimrod Megiddo:
Exact Computation of Optimal Inventory Policies Over an Unbounded Horizon. Math. Oper. Res. 16(3): 534-546 (1991) - [j45]Masakazu Kojima, Nimrod Megiddo, Toshihito Noma:
Homotopy Continuation Methods for Nonlinear Complementarity Problems. Math. Oper. Res. 16(4): 754-774 (1991) - [j44]Masakazu Kojima, Nimrod Megiddo, Toshihito Noma, Akiko Yoshise:
A unified approach to interior point algorithms for linear complementarity problems: A summary. Oper. Res. Lett. 10(5): 247-254 (1991) - [j43]Nimrod Megiddo, Christos H. Papadimitriou:
On Total Functions, Existence Theorems and Computational Complexity. Theor. Comput. Sci. 81(2): 317-324 (1991) - [c14]Edith Cohen, Nimrod Megiddo:
Algorithms and Complexity Analysis for Some Flow Problems. SODA 1991: 120-130 - [c13]Edith Cohen, Nimrod Megiddo:
Improved Algorithms for Linear Inequalities with Two Variables per Inequality (Extended Abstract). STOC 1991: 145-155 - 1990
- [j42]Ronald Fagin, Joseph Y. Halpern, Nimrod Megiddo:
A Logic for Reasoning about Probabilities. Inf. Comput. 87(1/2): 78-128 (1990) - [j41]Nimrod Megiddo:
On the Complexity of Some Geometric Problems in Unbounded Dimension. J. Symb. Comput. 10(3/4): 327-334 (1990) - [j40]George S. Lueker, Nimrod Megiddo, Vijaya Ramachandran:
Linear Programming with Two Variables per Inequality in Poly-Log Time. SIAM J. Comput. 19(6): 1000-1010 (1990) - [c12]Edith Cohen, Nimrod Megiddo:
Recognizing Properties of Periodic Graphs. Applied Geometry And Discrete Mathematics 1990: 135-146 - [c11]Noga Alon, Nimrod Megiddo:
Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time. FOCS 1990: 574-582
1980 – 1989
- 1989
- [j39]Nimrod Megiddo:
Extending NC and RNC Algorithms. Algorithmica 4(4): 501-517 (1989) - [j38]Nimrod Megiddo:
On the Ball Spanned by Balls. Discret. Comput. Geom. 4: 605-610 (1989) - [j37]Nimrod Megiddo, Michael Shub:
Boundary Behavior of Interior Point Algorithms in Linear Programming. Math. Oper. Res. 14(1): 97-146 (1989) - [c10]Edith Cohen, Nimrod Megiddo:
Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Dynamic Graphs (Preliminary Version). STOC 1989: 523-534 - 1988
- [j36]Nimrod Megiddo:
On the Complexity of Polyhedral Separability. Discret. Comput. Geom. 3: 325-337 (1988) - [j35]Nimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou:
The complexity of searching a graph. J. ACM 35(1): 18-44 (1988) - [j34]Nimrod Megiddo, Uzi Vishkin:
On Finding a Minimum Dominating Set in a Tournament. Theor. Comput. Sci. 61: 307-316 (1988) - [c9]Ronald Fagin, Joseph Y. Halpern, Nimrod Megiddo:
A Logic for Reasoning about Probabilities. LICS 1988: 410-421 - 1986
- [j33]Nimrod Megiddo:
Introduction: New Approaches to Linear Programming. Algorithmica 1(4): 387-394 (1986) - [j32]Nimrod Megiddo, Eitan Zemel:
An O(n log n) Randomizing Algorithm for the Weighted Euclidean 1-Center Problem. J. Algorithms 7(3): 358-368 (1986) - [j31]Nimrod Megiddo:
Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm. Math. Program. 35(2): 140-172 (1986) - [j30]Nimrod Megiddo:
On the expected number of linear complementarity cones intersected by random and semi-random rays. Math. Program. 35(2): 225-235 (1986) - [j29]Nimrod Megiddo:
A note on degeneracy in linear programming. Math. Program. 35(3): 365-367 (1986) - [c8]George S. Lueker, Nimrod Megiddo, Vijaya Ramachandran:
Linear Programming with Two Variables per Inequality in Poly-Log Time (Preliminary Version). STOC 1986: 196-205 - [c7]Nimrod Megiddo, Avi Wigderson:
On Play by Means of Computing Machines. TARK 1986: 259-274 - 1985
- [j28]Ilan Adler, Nimrod Megiddo:
A Simplex Algorithm Whose Average Number of Steps Is Bounded between Two Quadratic Functions of the Smaller Dimension. J. ACM 32(4): 871-895 (1985) - [j27]Refael Hassin, Nimrod Megiddo:
An Optimal Algorithm for Finding all the Jumps of a Monotone Step-Function. J. Algorithms 6(2): 265-274 (1985) - [j26]Nimrod Megiddo:
Partitioning with Two Lines in the Plane. J. Algorithms 6(3): 430-433 (1985) - [j25]Joseph Y. Halpern, Nimrod Megiddo, Ashfaq A. Munshi:
Optimal precision in the presence of uncertainty. J. Complex. 1(2): 170-196 (1985) - [j24]Nimrod Megiddo, Tetsuo Ichimori:
A Two-Resource Allocation Problem Solvable in Linear Time. Math. Oper. Res. 10(1): 7-16 (1985) - [c6]Joseph Y. Halpern, Nimrod Megiddo, Ashfaq A. Munshi:
Optimal Precision in the Presence of Uncertainty (Preliminary Version). STOC 1985: 346-355 - 1984
- [j23]Nimrod Megiddo:
Linear Programming in Linear Time When the Dimension Is Fixed. J. ACM 31(1): 114-127 (1984) - [j22]Nimrod Megiddo, Kenneth J. Supowit:
On the Complexity of Some Common Geometric Location Problems. SIAM J. Comput. 13(1): 182-196 (1984) - [c5]Ilan Adler, Nimrod Megiddo:
A Simplex Algorithm Whose Average Number of Steps is Bounded between Two Quadratic Functions of the Smaller Dimension. STOC 1984: 312-323 - 1983
- [j21]Nimrod Megiddo:
Applying Parallel Computation Algorithms in the Design of Serial Algorithms. J. ACM 30(4): 852-865 (1983) - [j20]Nimrod Megiddo:
The Weighted Euclidean 1-Center Problem. Math. Oper. Res. 8(4): 498-504 (1983) - [j19]Nimrod Megiddo:
Towards a Genuinely Polynomial Algorithm for Linear Programming. SIAM J. Comput. 12(2): 347-353 (1983) - [j18]Nimrod Megiddo, Arie Tamir:
New Results on the Complexity of p-Center Problems. SIAM J. Comput. 12(4): 751-758 (1983) - [j17]Nimrod Megiddo:
Linear-Time Algorithms for Linear Programming in R3 and Related Problems. SIAM J. Comput. 12(4): 759-776 (1983) - 1982
- [j16]Nimrod Megiddo:
On the complexity of the one-terminal network design problem. Oper. Res. Lett. 1(3): 105-107 (1982) - [j15]Nimrod Megiddo, Arie Tamir:
On the complexity of locating linear facilities in the plane. Oper. Res. Lett. 1(5): 194-197 (1982) - [j14]Nimrod Megiddo:
Is Binary Encoding Appropriate for the Problem-Language Relationship? Theor. Comput. Sci. 19: 337-341 (1982) - [c4]Nimrod Megiddo:
Linear-Time Algorithms for Linear Programming in R^3 and Related Problems. FOCS 1982: 329-338 - 1981
- [j13]Nimrod Megiddo, Arie Tamir, Eitan Zemel, R. Chandrasekaran:
An O(n log2 n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems. SIAM J. Comput. 10(2): 328-337 (1981) - [c3]Nimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou:
The Complexity of Searching a Graph (Preliminary Version). FOCS 1981: 376-385 - [c2]Nimrod Megiddo:
Applying Parallel Computation Algorithms in the Design of Serial Algorithms. FOCS 1981: 399-408
1970 – 1979
- 1979
- [j12]Zvi Galil, Nimrod Megiddo:
A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort. J. ACM 26(1): 58-64 (1979) - [j11]Nimrod Megiddo, Zvi Galil:
On Fulkerson's Conjecture About Consistent Labeling Processes. Math. Oper. Res. 4(3): 265-267 (1979) - [j10]Nimrod Megiddo:
Combinatorial Optimization with Rational Objective Functions. Math. Oper. Res. 4(4): 414-424 (1979) - 1978
- [j9]Nimrod Megiddo:
Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree. Math. Oper. Res. 3(3): 189-196 (1978) - [j8]Nimrod Megiddo:
Cost allocation for steiner trees. Networks 8(1): 1-6 (1978) - [j7]Nimrod Megiddo, Arie Tamir:
An O(N log N) Algorithm for a Class of Matching Problems. SIAM J. Comput. 7(2): 154-157 (1978) - [c1]Nimrod Megiddo:
Combinatorial Optimization with Rational Objective Functions. STOC 1978: 1-12 - 1977
- [j6]Nimrod Megiddo:
Mixtures of order matrices and generalized order matrices. Discret. Math. 19(2): 177-181 (1977) - [j5]Nimrod Megiddo:
On monotonicity in parametric linear complementarity problems. Math. Program. 12(1): 60-66 (1977) - [j4]Nimrod Megiddo, Masakazu Kojima:
On the existence and uniqueness of solutions in nonlinear complementarity theory. Math. Program. 12(1): 110-130 (1977) - [j3]Nimrod Megiddo:
A monotone complementarity problem with feasible solutions but no complementary solutions. Math. Program. 12(1): 131-132 (1977) - [j2]Zvi Galil, Nimrod Megiddo:
Cyclic Ordering is NP-Complete. Theor. Comput. Sci. 5(2): 179-182 (1977) - 1974
- [j1]Nimrod Megiddo:
Optimal flows in networks with multiple sources and sinks. Math. Program. 7(1): 97-107 (1974)
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-08-05 20:26 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:
