Остановите войну!
for scientists:
default search action
Nimrod Megiddo
- > Home > Persons > Nimrod Megiddo
Publications
- 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) - 2010
- [c45]Nimrod Megiddo:
Formation of preferences and strategic analysis. BQGT 2010: 70:1 - 1994
- [c21]Nimrod Megiddo:
On Probabilistic Machines, Bounded Rationality and Average-Case Complexity. Essays in Game Theory 1994: 123-128 - [e1]Nimrod Megiddo:
Essays in Game Theory, In Honor of Michael Maschler. Springer 1994, ISBN 978-1-4612-7621-0 [contents] - 1992
- [j50]Nimrod Megiddo:
A Note on Approximate Linear Programming. Inf. Process. Lett. 42(1): 53 (1992) - 1991
- [j47]Nimrod Megiddo:
On Finding Primal- and Dual-Optimal Bases. INFORMS J. Comput. 3(1): 63-65 (1991) - 1990
- [j41]Nimrod Megiddo:
On the Complexity of Some Geometric Problems in Unbounded Dimension. J. Symb. Comput. 10(3/4): 327-334 (1990) - 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) - 1988
- [j36]Nimrod Megiddo:
On the Complexity of Polyhedral Separability. Discret. Comput. Geom. 3: 325-337 (1988) - 1986
- [j33]Nimrod Megiddo:
Introduction: New Approaches to Linear Programming. Algorithmica 1(4): 387-394 (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) - 1985
- [j26]Nimrod Megiddo:
Partitioning with Two Lines in the Plane. J. Algorithms 6(3): 430-433 (1985) - 1984
- [j23]Nimrod Megiddo:
Linear Programming in Linear Time When the Dimension Is Fixed. J. ACM 31(1): 114-127 (1984) - 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) - [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) - [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
- [c2]Nimrod Megiddo:
Applying Parallel Computation Algorithms in the Design of Serial Algorithms. FOCS 1981: 399-408 - 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) - [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) - [j3]Nimrod Megiddo:
A monotone complementarity problem with feasible solutions but no complementary solutions. Math. Program. 12(1): 131-132 (1977) - 1974
- [j1]Nimrod Megiddo:
Optimal flows in networks with multiple sources and sinks. Math. Program. 7(1): 97-107 (1974)
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-04-25 02:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint