Evangelos Bampas

Follow

Generating author description...

Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ Acceptor-Definable Counting Classes 2003 Aggelos Kiayias
Aris Pagourtzis
Kiron Sharma
Stathis Zachos
2
+ The Complexity of Counting Functions with Easy Decision Version 2006 Aris Pagourtzis
Stathis Zachos
2
+ Monte-Carlo approximation algorithms for enumeration problems 1989 Richard M. Karp
Michael Luby
Neal Madras
2
+ The Complexity of Enumeration and Reliability Problems 1979 Leslie G. Valiant
2
+ A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries 2004 Mark Jerrum
Alistair Sinclair
Eric Vigoda
2
+ PDF Chat The Complexity of Computing the Size of an Interval 2006 Lane A. Hemaspaandra
Christopher M. Homan
Sven Kosub
Klaus W. Wagner
2
+ PDF Chat The Relative Complexity of Approximate Counting Problems 2003 Martin Dyer
Leslie Ann Goldberg
Catherine Greenhill
Mark Jerrum
2
+ A very hard log-space counting class 1993 Carme Àlvarez
Birgit Jenner
2
+ Counting independent sets up to the tree threshold 2006 Dror Weitz
2
+ The complexity of computing the permanent 1979 Leslie G. Valiant
2
+ THE OPERATORS MIN AND MAX ON THE POLYNOMIAL HIERARCHY 2000 Harald Hempel⋆
Gerd Wechsung
2
+ PDF Chat Physical Expander in Virtual Tree Overlay 2011 Taisuke Izumi
Maria Potop-Butucaru
Mathieu Valero
1
+ PDF Chat FPTAS for Counting Weighted Edge Covers 2014 Jing‐Cheng Liu
Pinyan Lu
Chihao Zhang
1
+ On the Connection between Interval Size Functions and Path Counting 2009 Evangelos Bampas
Andreas-Nikolas Göbel
Aris Pagourtzis
Aris Tentes
1
+ Introduction to Algorithms 1991 V. J. Rayward‐Smith
Thomas H. Cormen
Charles E. Leiserson
Ronald L. Rivest
1
+ PDF Chat Available stabilizing heaps 2001 Ted Herman
Toshimitsu Masuzawa
1