Society has reached a point of no return, one that leaves us completely reliant on omnipresent ICT-mediated communication. Mobile and sensor-rich portable devices connect millions of humans with Petabytes of data and numerous on-line services. However, tearing down the physical-digital barrier in a scalable fashion requires both radically novel algorithmic knowledge and in-depth understanding of humans and societies. We will deliver major theoretical advances in real-time intelligent information management of large datasets including online social networks, mobile devices and humans in physical space by delivering three functions: “alert”, by real-time location-aware knowledge acquisition, analysis and visualization; “response”, through on-demand composition and coordination of large teams; and effective “communication”, through recommendation and personalization.
Publication date
2015
In: Frontiers in Algorithmics Lecture Notes in Computer Science (9130) Springer, Berlin; Heidelberg; New York, pp. 125-137.
On Solving Systems of Diagonal Polynomial Equations Over Finite Fields
In: 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016 Association for Computing Machinery, Cambridge (MA), pp. 570-583. ISSN 0737-8017
A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting
In: 19th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2016 and the 20th International Workshop on Randomization and Computation, RANDOM 2016 Leibniz International Proceedings in Informatics, LIPIcs (60) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 5:1-5:12. ISSN 1868-8969
Approximation algorithms for parallel machine scheduling with speed-up resources