The following pages link to Alexis C. Kaporis (Q389950):
Displaying 35 items.
- On the hardness of network design for bottleneck routing games (Q389953) (← links)
- Efficient methods for selfish network design (Q442104) (← links)
- Selfish splittable flows and NP-completeness (Q465681) (← links)
- (Q592676) (redirect page) (← links)
- (Q616987) (redirect page) (← links)
- ISB-tree: A new indexing scheme with efficient expected behaviour (Q616991) (← links)
- The impact of social ignorance on weighted congestion games (Q692896) (← links)
- Atomic congestion games: fast, myopic and concurrent (Q987399) (← links)
- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions (Q1006047) (← links)
- Improved bounds for finger search on a RAM (Q1950391) (← links)
- A note on the non-colorability threshold of a random graph (Q1978060) (← links)
- Dynamic interpolation search revisited (Q2288214) (← links)
- Resolving Braess's paradox in random networks (Q2408090) (← links)
- Dynamic 3-sided planar range queries with expected doubly-logarithmic time (Q2437762) (← links)
- The unsatisfiability threshold revisited (Q2643297) (← links)
- (Q2741515) (← links)
- Locating Information with Uncertainty in Fully Interconnected Networks with Applications to World Wide Web Information Retrieval (Q2765224) (← links)
- Resolving Braess’s Paradox in Random Networks (Q2937757) (← links)
- Selecting Complementary Pairs of Literals (Q3439115) (← links)
- (Q3597154) (← links)
- Dynamic Interpolation Search Revisited (Q3613775) (← links)
- Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time (Q3652205) (← links)
- On the chromatic number of a random 5-regular graph (Q3652529) (← links)
- (Q4411392) (← links)
- (Q4448374) (← links)
- On the Hardness of Network Design for Bottleneck Routing Games (Q4910942) (← links)
- Efficient Methods for Selfish Network Design (Q5321677) (← links)
- Approximating Almost All Instances of Max-Cut Within a Ratio Above the Håstad Threshold (Q5449548) (← links)
- Atomic Congestion Games: Fast, Myopic and Concurrent (Q5459977) (← links)
- Algorithms – ESA 2005 (Q5475834) (← links)
- The probabilistic analysis of a greedy satisfiability algorithm (Q5486323) (← links)
- Experimental and Efficient Algorithms (Q5710075) (← links)
- Algorithms - ESA 2003 (Q5897257) (← links)
- Algorithms and Computation (Q5897865) (← links)
- Random input helps searching predecessors (Q6631233) (← links)
