The following pages link to Lefteris M. Kirousis (Q215098):
Displaying 36 items.
- (Q315520) (redirect page) (← links)
- On the stability of generalized second price auctions with budgets (Q315522) (← links)
- Acyclic edge coloring through the Lovász local lemma (Q507595) (← links)
- Interval graphs and searching (Q1059088) (← links)
- The complexity of recognizing polyhedral scenes (Q1109582) (← links)
- The complexity of the reliable connectivity problem (Q1183401) (← links)
- Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays (Q1260649) (← links)
- Fast parallel constraint satisfaction (Q1313952) (← links)
- Simple atomic snapshots: A linear complexity solution with unbounded time-stamps (Q1351169) (← links)
- Fugitive-search games on graphs and related parameters (Q1392025) (← links)
- (Q1575643) (redirect page) (← links)
- Power consumption in packet radio networks (Q1575645) (← links)
- On parallel partial solutions and approximation schemes for local consistency in networks of constraints (Q1579084) (← links)
- On the computational complexity of non-dictatorial aggregation (Q1617839) (← links)
- A dichotomy in the complexity of propositional circumscription (Q1764422) (← links)
- Searching and pebbling (Q1821562) (← links)
- The complexity of minimal satisfiability problems (Q1887137) (← links)
- Efficient algorithms for checking the atomicity of a run of read and write operations (Q1892712) (← links)
- A note on the non-colorability threshold of a random graph (Q1978060) (← links)
- Correction to: ``Directed Lovász local lemma and Shearer's lemma'' (Q2035640) (← links)
- On the satisfiability threshold of formulas with three literals per clause (Q2271431) (← links)
- An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects (Q2273354) (← links)
- Directed Lovász local lemma and Shearer's lemma (Q2294597) (← links)
- The unsatisfiability threshold revisited (Q2643297) (← links)
- (Q2729093) (← links)
- (Q2741515) (← links)
- (Q2762521) (← links)
- Locating Information with Uncertainty in Fully Interconnected Networks with Applications to World Wide Web Information Retrieval (Q2765224) (← links)
- (Q2766883) (← links)
- Partiality and approximation schemes for local consistency in networks of constraints (Q2956684) (← links)
- A new upper bound for 3-SAT (Q3165956) (← links)
- Selecting Complementary Pairs of Literals (Q3439115) (← links)
- Power consumption in packet radio networks (Q5048938) (← links)
- (Q5091205) (← links)
- On the Computational Complexity of Non-Dictatorial Aggregation (Q5154769) (← links)
- The probabilistic analysis of a greedy satisfiability algorithm (Q5486323) (← links)
