Alexis C. Kaporis

From MaRDI portal
Revision as of 17:19, 11 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Alexis C. Kaporis to Alexis C. Kaporis: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:389950

Available identifiers

zbMath Open kaporis.alexis-cWikidataQ102509824 ScholiaQ102509824MaRDI QIDQ389950

List of research outcomes





PublicationDate of PublicationType
Random input helps searching predecessors2024-10-31Paper
Dynamic interpolation search revisited2020-01-17Paper
Resolving Braess's paradox in random networks2017-10-09Paper
Resolving Braess’s Paradox in Random Networks2015-01-12Paper
Selfish splittable flows and NP-completeness2014-10-24Paper
Dynamic 3-sided planar range queries with expected doubly-logarithmic time2014-03-13Paper
On the hardness of network design for bottleneck routing games2014-01-22Paper
Improved bounds for finger search on a RAM2013-05-13Paper
On the Hardness of Network Design for Bottleneck Routing Games2013-03-13Paper
The impact of social ignorance on weighted congestion games2012-12-06Paper
Efficient methods for selfish network design2012-08-09Paper
ISB-tree: A new indexing scheme with efficient expected behaviour2011-01-20Paper
Atomic congestion games: fast, myopic and concurrent2010-08-13Paper
Algorithms - ESA 20032010-03-03Paper
On the chromatic number of a random 5-regular graph2009-12-18Paper
Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time2009-12-17Paper
Efficient Methods for Selfish Network Design2009-07-14Paper
The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions2009-03-17Paper
Dynamic Interpolation Search Revisited2009-03-12Paper
https://portal.mardi4nfdi.de/entity/Q35971542009-02-09Paper
Atomic Congestion Games: Fast, Myopic and Concurrent2008-05-02Paper
Approximating Almost All Instances of Max-Cut Within a Ratio Above the Håstad Threshold2008-03-11Paper
The unsatisfiability threshold revisited2007-08-23Paper
Selecting Complementary Pairs of Literals2007-05-29Paper
Algorithms and Computation2006-11-14Paper
The probabilistic analysis of a greedy satisfiability algorithm2006-09-06Paper
Algorithms – ESA 20052006-06-27Paper
Experimental and Efficient Algorithms2005-11-30Paper
https://portal.mardi4nfdi.de/entity/Q44483742004-02-18Paper
https://portal.mardi4nfdi.de/entity/Q44113922003-07-08Paper
Locating Information with Uncertainty in Fully Interconnected Networks with Applications to World Wide Web Information Retrieval2002-01-23Paper
https://portal.mardi4nfdi.de/entity/Q27415152001-09-24Paper
A note on the non-colorability threshold of a random graph2000-06-07Paper

Research outcomes over time

This page was built for person: Alexis C. Kaporis