Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Viglas, Anastasios"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the approximability of the link building problem
Martin Olsen
,
Anastasios Viglas
Theoretical Computer Science
518
, 2014, pp. 96-116
On-line algorithms for market equilibria
Spyros Angelopoulos
,
Atish Das Sarma
,
Avner Magen
,
Anastasios Viglas
Lecture Notes in Computer Science
3595
, 2005, pp. 596-607
Time-space lower bounds for satisfiability
Lance Fortnow
,
Richard Lipton
,
Dieter van Melkebeek
,
Anastasios Viglas
Journal of the ACM
52
(6), 2005, pp. 835-865
On the complexity of intersecting finite state automata and
NL
versus
NP
George Karakostas
,
Richard J. Lipton
,
Anastasios Viglas
Theoretical Computer Science
302
(1-3), 2003, pp. 257-274
Equilibria for networks with malicious users
George Karakostas
,
Anastasios Viglas
Lecture Notes in Computer Science
2906
, 2003, pp. 696-704
On the complexity of intersecting finite state automata
George Karakostas
,
Richard J. Lipton
,
Anastasios Viglas
Proceedings of the 15th Annual IEEE Conference on Computational Complexity (Florence, Italy, July 4-7, 2000)
, 2000, pp. 229-234