Researcher Portfolio
Setty, Vinay
Databases and Information Systems, MPI for Informatics, Max Planck Society
Researcher Profile
Position: Databases and Information Systems, MPI for Informatics, Max Planck Society
Researcher ID: https://pure.mpg.de/cone/persons/resource/persons45461
Publications
: Fotakis, D., Pagh, R., Sanders, P., & Spirakis, P. (2005). Space Efficient Hash Tables With Worst Case Constant Access Time. Theory of Computing Systems, 38, 229-248. [PubMan] : Fotakis, D. (2004). Incremental Algorithms for Facility Location and k-Median. In Algorithms – ESA 2004: 12th Annual European Symposium (pp. 347-358). Berlin, Germany: Springer. [PubMan] : Fotakis, D. (2003). On the Competitive Ratio for Online Facility Location. In Automata, languages and programming: 30th International Colloquium, ICALP 2003 (pp. 637-652). Berlin, Germany: Springer. [PubMan] : Fotakis, D., Pagh, R., Sanders, P., & Spirakis, P. G. (2003). Space Efficient Hash Tables with Worst Case Constant Access Time. In Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003) (pp. 271-282). Berlin, Germany: Springer. [PubMan] : Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., & Spirakis, P. G. (2002). The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. In Automata, Languages and Programming: 29th International Colloquium, ICALP 2002 (pp. 123-134). Berlin, Germany: Springer. [PubMan] : Fotakis, D., Nikoletseas, S., Papadopoulou, V., & Spirakis, P. G. (2002). Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies. In Graph-Theoretic Concepts in Computer Science: 28th International Workshop, WG 2002 (pp. 223-234). Berlin, Germany: Springer. [PubMan] : Fotakis, D., & Spirakis, P. G. (2002). Minimum Congestion Redundant Assignments to Tolerate Random Faults. Algorithmica, 32, 396-422. [PubMan] : Andreou, M., Fotakis, D., Nikoletseas, S., Papadopoulou, V., & Spirakis, P. G. (2002). On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations. In Mathematical Foundations of Computer Science 2002: 27th International Symposium, MFCS 2002 (pp. 81-92). Berlin, Germany: Springer. [PubMan]