210 search results - page 7 / 42 » Uniform regular enumerations |
SOFSEM
2000
Springer
13 years 11 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
Random regular graphs play a central role in combinatorics and theoretical computer science. In this paper, we analyze a simple algorithm introduced by Steger and Wormald [10] and...
JUCS
2002
13 years 7 months ago
2002
: We consider a uniform way of treating objects and rules in P systems: we start with multisets of rules, which are consumed when they are applied, but the application of a rule ma...
JSYML
2006
13 years 7 months ago
2006
Abstract. We explore the interaction between Lebesgue measure and dominating functions. We show, via both a priority construction and a forcing construction, that there is a functi...
CSL
2003
Springer
14 years 18 days ago
2003
Springer
Using the Lempel-Ziv-78 compression algorithm to compress a string yields a dictionary of substrings, i.e. an edge-labelled tree with an order-compatible enumeration, here called a...