Alexis C. Kaporis

According to our database1, Alexis C. Kaporis authored at least 44 papers between 2000 and 2018.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Random input helps searching predecessors.
Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, 2018

2017
Resolving Braess's Paradox in Random Networks.
Algorithmica, 2017

2016
Stackelberg Games: The Price of Optimum.
Encyclopedia of Algorithms, 2016

Thresholds of Random k-Sat.
Encyclopedia of Algorithms, 2016

2014
On the hardness of network design for bottleneck routing games.
Theor. Comput. Sci., 2014

Dynamic 3-sided planar range queries with expected doubly-logarithmic time.
Theor. Comput. Sci., 2014

2013
Improved Bounds for Finger Search on a RAM.
Algorithmica, 2013

Resolving Braess's Paradox in Random Networks.
Proceedings of the Web and Internet Economics - 9th International Conference, 2013

2012
Efficient methods for selfish network design.
Theor. Comput. Sci., 2012

The Impact of Social Ignorance on Weighted Congestion Games.
Theory Comput. Syst., 2012

On the Hardness of Network Design for Bottleneck Routing Games
CoRR, 2012

Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time
CoRR, 2012

On the Hardness of Network Design for Bottleneck Routing Games.
Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

2011
Selfish splittable flows and NP-completeness.
Computer Science Review, 2011

Random input helps searching predecessors
CoRR, 2011

2010
Atomic Congestion Games: Fast, Myopic and Concurrent.
Theory Comput. Syst., 2010

ISB-tree: A new indexing scheme with efficient expected behaviour.
J. Discrete Algorithms, 2010

Efficient processing of 3-sided range queries with probabilistic guarantees.
Proceedings of the Database Theory, 2010

2009
The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions.
Theor. Comput. Sci., 2009

On the chromatic number of a random 5-regular graph.
Journal of Graph Theory, 2009

The Impact of Social Ignorance on Weighted Congestion Games.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Efficient Methods for Selfish Network Design.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008
Stackelberg Games: The Price of Optimum.
Proceedings of the Encyclopedia of Algorithms, 2008

Thresholds of Random k-Sat.
Proceedings of the Encyclopedia of Algorithms, 2008

Emerge-Sort: Converging to Ordered Sequences by Simple Local Operators
CoRR, 2008

Myopic Distributed Protocols for Singleton and Independent-Resource Congestion Games.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

Atomic Congestion Games: Fast, Myopic and Concurrent.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

2007
The unsatisfiability threshold revisited.
Discrete Applied Mathematics, 2007

2006
The probabilistic analysis of a greedy satisfiability algorithm.
Random Struct. Algorithms, 2006

The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

Dynamic Interpolation Search Revisited.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Approximating Almost All Instances of Max-Cut Within a Ratio Above the Håstad Threshold.
Proceedings of the Algorithms, 2006

2005
The Price of Optimum in Stackelberg Games
Electronic Colloquium on Computational Complexity (ECCC), 2005

Experimental Results for Stackelberg Scheduling Strategies.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

ISB-Tree: A New Indexing Scheme with Efficient Expected Behaviour.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

5-Regular Graphs are 3-Colorable with Positive Probability.
Proceedings of the Algorithms, 2005

2003
Selecting Complementary Pairs of Literals.
Electronic Notes in Discrete Mathematics, 2003

Improved Bounds for Finger Search on a RAM.
Proceedings of the Algorithms, 2003

2002
The Probabilistic Analysis of a Greedy Satisfiability Algorithm.
Proceedings of the Algorithms, 2002

2001
The unsatisfiability threshold revisited.
Electronic Notes in Discrete Mathematics, 2001

Locating Information with Uncertainty in Fully Interconnected Networks with Applications to World Wide Web Information Retrieval.
Comput. J., 2001

Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

2000
A Note on the Non-Colorability Threshold of a Random Graph.
Electr. J. Comb., 2000


  Loading...