Journal•ISSN: 0252-9742
Bulletin of The European Association for Theoretical Computer Science
European Association for Theoretical Computer Science
About: Bulletin of The European Association for Theoretical Computer Science is an academic journal. The journal publishes majorly in the area(s): Column (database) & Formal language. Over the lifetime, 770 publications have been published receiving 13177 citations.
Papers published on a yearly basis
Papers
More filters
Journal Article•
[...]
TL;DR: The presented approach may be considered as an alternative to fuzzy sets theory and tolerance theory and some applications are outlined.
Abstract: W: Bulletin of the European Association for Theoretical Computer Science (EATCS), 24:94-109, 1984
1,379 citations
Journal Article•
TL;DR: This paper provides an elementary introduction to the probabilistic automaton (PA) model, which has been developed by Segala, and treats the parallel composition operator on PAs, the semantics of a PA as a set of trace distributions, an extension of the PA model with time and simulation relations for PAs.
Abstract: This paper provides an elementary introduction to the probabilistic automaton (PA) model, which has been developed by Segala. We describe how distributed systems with discrete probabilities can be modeled and analyzed by means of PAs. We explain how the basic concepts for the analysis of nonprobabilistic automata can be extended to probabilistic systems. In particular, we treat the parallel composition operator on PAs, the semantics of a PA as a set of trace distributions, an extension of the PA model with time and simulation relations for PAs. Finally, we give an overview of various other state based models that are used for the analysis of probabilistic systems.
407 citations
TL;DR: This chapter proves lower bounds based on ETH for the time needed to solve various problems, and in many cases these lower bounds match the running time of the best known algorithms for the problem.
Abstract: The Exponential Time Hypothesis (ETH) is a conjecture stating that, roughly speaking, n-variable 3-SAT cannot be solved in time 2o(n). In this chapter, we prove lower bounds based on ETH for the time needed to solve various problems. In many cases, these lower bounds match (up to small factors) the running time of the best known algorithms for the problem.
396 citations
Journal Article•
TL;DR: This manuscript is a survey of recent developments in extractors and focuses on explicit constructions of extractors following Trevisan’s breakthrough result.
Abstract: Extractors are functions which are able to “extract” random bits from arbitrary distributions which “contain” sufficient randomness. Explicit constructions of extractors have many applications in complexity theory and combinatorics. This manuscript is a survey of recent developments in extractors and focuses on explicit constructions of extractors following Trevisan’s breakthrough result [Tre99].
359 citations