The following pages link to Denis Pankratov (Q504998):
Displaying 21 items.
- Information lower bounds via self-reducibility (Q504999) (← links)
- Graph exploration by energy-sharing mobile agents (Q2117723) (← links)
- The bike sharing problem (Q2232233) (← links)
- Advice complexity of online non-crossing matching (Q2678256) (← links)
- Information Lower Bounds via Self-reducibility (Q4928483) (← links)
- On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem (Q4930591) (← links)
- (Q4993273) (← links)
- Greedy Bipartite Matching in Random Type Poisson Arrival Model (Q5009497) (← links)
- Exploration of High-Dimensional Grids by Finite Automata (Q5092342) (← links)
- A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version (Q5240422) (← links)
- From information to exact communication (Q5495785) (← links)
- Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes (Q5889793) (← links)
- On conceptually simple algorithms for variants of online bipartite matching (Q5915658) (← links)
- Advice complexity of priority algorithms (Q5916086) (← links)
- Online coloring and a new type of adversary for online graph problems (Q5918632) (← links)
- Online coloring and a new type of adversary for online graph problems (Q5970811) (← links)
- Online Domination: The Value of Getting to Know All Your Neighbors. (Q6168474) (← links)
- Advice complexity of adaptive priority algorithms (Q6180750) (← links)
- (Q6187825) (← links)
- Exploration of High-Dimensional Grids by Finite State Machines (Q6492093) (← links)
- Renting servers in the cloud: the case of equal duration jobs (Q6657265) (← links)
