| Competitive Algorithms for Generalized k-Server |
Grigorios Koumoutsos |
Corelab, ECE NTUA |
|
| Beyond Worst-Case Analysis of Algorithms: Smoothed Analysis Chapter |
Mανώλης Βλατάκης |
Corelab, ECE NTUA |
|
| Completeness and approximability of counting functions with easy decision version & Markov chains and phase transitions for TotP-complete problems. |
Ελένη Μπακάλη |
Corelab, ECE NTUA |
|
| Axiomatising verdict equivalence over regular monitors |
Elli Anastasiadi |
Corelab, ECE NTUA |
|
| 90 Years of Computability and Complexity |
Στάθης Ζάχος |
Corelab, ECE NTUA |
|
| The price of stability of (weighted) congestion games with polynomial latencies |
Giorgos Christodoulou |
Corelab, ECE NTUA |
|
| The Dynamic Complexity of Acyclic Conjunctive Queries |
Ioannis Kokkinis |
Corelab, ECE NTUA |
|
| Adventures in monitorability |
Antonis Achilleos |
Corelab, ECE NTUA |
|
| Privately Learning High-Dimensional Distributions |
Gautam Kamath |
Corelab, ECE NTUA |
|
| Circuits, Lower Bounds, and Circuit Analysis Algorithms |
Dimitris Myrisiotis |
Corelab, ECE NTUA |
|
| Optimal Circle Search Despite the Presence of Faulty Robots |
Γιάννης Παπαϊωάννου |
Corelab, ECE NTUA |
|
| Παραμετρική πολυπλοκότητα και έλεγχος μοντέλων σε φραγμένες οικογένειες γραφημάτων |
Έλλη Αναστασιάδη |
Corelab, ECE NTUA |
|
| Cryptocurrencies without need for consensus |
Μάριος Γεωργίου |
Corelab, ECE NTUA |
|
| Opinion dynamics with Limited Information |
Στρατής Σκουλάκης |
Corelab, ECE NTUA |
|
| Security of Blockchains against Incentive-Driven Attacks |
Βασίλης Ζήκας |
Corelab, ECE NTUA |
|
| Zeros and approximations of Holant polynomials on the complex plane |
Αντρέας Γκέμπελ |
Corelab, ECE NTUA |
|
| How to Induce Optimal Flows Under Strategic Link Operators |
Θανάσης Λιανέας |
Corelab, ECE NTUA |
|
| Hierarchical Clustering as a Tool for Unsupervised Learning: An Optimization Viewpoint / On the Computational Power of Online Gradient Descent |
Βαγγέλης Χατζηαφράτης |
Corelab, ECE NTUA |
|
| Label Ranking |
Ελένη Ψαρουδάκη |
Corelab, ECE NTUA |
|
| Ιδιότητες συναρτήσεων μέτρησης πλήθους λύσεων σε προβλήματα με εύκολη απόφαση ύπαρξης λύσης: πληρότητα, προσεγγισιμότητα, μαρκοβιανές αλυσίδες, αλλαγές φάσης |
Ελένη Μπακάλη |
Corelab, ECE NTUA |
|
