Anastasios Viglas
From MaRDI portal
Person:391784
Available identifiers
zbMath Open viglas.anastasiosMaRDI QIDQ391784
List of research outcomes
Publication | Date of Publication | Type |
---|---|---|
Time-space lower bounds for satisfiability | 2015-12-04 | Paper |
On the approximability of the link building problem | 2014-01-13 | Paper |
A Constant-Factor Approximation Algorithm for the Link Building Problem | 2011-01-10 | Paper |
Equilibria for networks with malicious users | 2010-07-21 | Paper |
Fundamentals of Computation Theory | 2010-04-20 | Paper |
Algorithms and Computation | 2009-08-07 | Paper |
Selfish Routing with Oblivious Users | 2007-11-15 | Paper |
Computing and Combinatorics | 2006-01-11 | Paper |
On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\) | 2003-08-17 | Paper |
Research outcomes over time
Doctoral students
No records found.
Known relations from the MaRDI Knowledge Graph
Property | Value |
---|---|
MaRDI profile type | MaRDI person profile |
instance of | human |
This page was built for person: Anastasios Viglas