List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Time-space lower bounds for satisfiability Journal of the ACM | 2015-12-04 | Paper |
| On the approximability of the link building problem Theoretical Computer Science | 2014-01-13 | Paper |
| A constant-factor approximation algorithm for the link building problem Combinatorial Optimization and Applications | 2011-01-10 | Paper |
| Equilibria for networks with malicious users Mathematical Programming. Series A. Series B | 2010-07-21 | Paper |
| Non-uniform depth of polynomial time and space simulations. Lecture Notes in Computer Science | 2010-04-20 | Paper |
| Algorithms and Computation Lecture Notes in Computer Science | 2009-08-07 | Paper |
| Selfish Routing with Oblivious Users Structural Information and Communication Complexity | 2007-11-15 | Paper |
| Computing and Combinatorics Lecture Notes in Computer Science | 2006-01-11 | Paper |
| On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\) Theoretical Computer Science | 2003-08-17 | Paper |
Research outcomes over time
This page was built for person: Anastasios Viglas
