Остановите войну!
for scientists:
default search action
Elias Koutsoupias
- > Home > Persons > Elias Koutsoupias
Publications
- 2019
- [c56]Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Christos H. Papadimitriou:
Energy Equilibria in Proof-of-Work Mining. EC 2019: 489-502 - [c54]Kurtulus Gemici, Elias Koutsoupias, Barnabé Monnot, Christos H. Papadimitriou, Georgios Piliouras:
Wealth Inequality and the Price of Anarchy. STACS 2019: 31:1-31:16 - 2018
- [i15]Kurtulus Gemici, Elias Koutsoupias, Barnabé Monnot, Christos H. Papadimitriou, Georgios Piliouras:
Wealth Inequality and the Price of Anarchy. CoRR abs/1802.09269 (2018) - 2009
- [j20]Elias Koutsoupias, Christos H. Papadimitriou:
Worst-case equilibria. Comput. Sci. Rev. 3(2): 65-69 (2009) - 2005
- [c23]Georgios Kouroupas, Elias Koutsoupias, Christos H. Papadimitriou, Martha Sideri:
Experiments with an Economic Model of the Worldwide Web. WINE 2005: 46-54 - [c22]Georgios Kouroupas, Elias Koutsoupias, Christos H. Papadimitriou, Martha Sideri:
An economic model of the worldwide web. WWW (Special interest tracks and posters) 2005: 934-935 - 2002
- [j9]Joseph M. Hellerstein, Elias Koutsoupias, Daniel P. Miranker, Christos H. Papadimitriou, Vasilis Samoladas:
On a model of indexability and its bounds for range queries. J. ACM 49(1): 35-55 (2002) - [c17]Alex Fabrikant, Elias Koutsoupias, Christos H. Papadimitriou:
Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet. ICALP 2002: 110-122 - 2000
- [j8]Elias Koutsoupias, Christos H. Papadimitriou:
Beyond Competitive Analysis. SIAM J. Comput. 30(1): 300-317 (2000) - [c14]Richard M. Karp, Elias Koutsoupias, Christos H. Papadimitriou, Scott Shenker:
Optimization Problems in Congestion Control. FOCS 2000: 66-74 - 1999
- [c9]Elias Koutsoupias, Christos H. Papadimitriou:
Worst-case Equilibria. STACS 1999: 404-413 - 1997
- [c7]Joseph M. Hellerstein, Elias Koutsoupias, Christos H. Papadimitriou:
On the Analysis of Indexing Schemes. PODS 1997: 249-256 - 1996
- [j5]Elias Koutsoupias, Christos H. Papadimitriou:
The 2-Evader Problem. Inf. Process. Lett. 57(5): 249-252 (1996) - [c6]Elias Koutsoupias, Christos H. Papadimitriou, Mihalis Yannakakis:
Searching a Fixed Graph. ICALP 1996: 280-289 - 1995
- [j4]Elias Koutsoupias, Christos H. Papadimitriou:
On the k-Server Conjecture. J. ACM 42(5): 971-983 (1995) - [c5]Michelangelo Grigni, Elias Koutsoupias, Christos H. Papadimitriou:
An Approximation Scheme for Planar Graph TSP. FOCS 1995: 640-645 - 1994
- [c3]Elias Koutsoupias, Christos H. Papadimitriou:
Beyond Competitive Analysis. FOCS 1994: 394-400 - 1992
- [j2]Elias Koutsoupias, Christos H. Papadimitriou, Martha Sideri:
On the Optimal Bisection of a Polygon. INFORMS J. Comput. 4(4): 435-438 (1992) - [j1]Elias Koutsoupias, Christos H. Papadimitriou:
On the Greedy Algorithm for Satisfiability. Inf. Process. Lett. 43(1): 53-55 (1992) - 1990
- [c1]Elias Koutsoupias, Christos H. Papadimitriou, Martha Sideri:
On the Optimal Bisection of a Polygon (Extended Abstract). SCG 1990: 198-202
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-05-08 23: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