| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 28
reviews
|
|
|
 |
|
|
|
|
 Equality sets of prefix morphisms and regular star languages
Halava V., Harju T., Latteux M. Information Processing Letters 94(4): 151-154, 2005. Type: Article
This paper continues a long line of research in formal language theory into morphic representations for classes of languages. The paper is mainly concerned with showing that a language L ⊆...
|
Sep 28 2005 |
|
|
|
|
|
|
Equality sets of prefix morphisms and regular star languages
Halava V., Harju T., Latteux M. Information Processing Letters 94(4): 151-154, 2005. Type: Article
This paper continues a long line of research in formal language theory into morphic representations for classes of languages. The paper is mainly concerned with showing that a language L ⊆...
|
Sep 28 2005 |
|
|
|
|
|
|
Simple extractors for all min-entropies and a new pseudorandom generator
Shaltiel R., Umans C. Journal of the ACM 52(2): 172-216, 2005. Type: Article
This paper continues an investigation into constructions of extractors and pseudorandom number generators (PNGs). The authors present a simple GF(q)[x] polynomial-based unified a...
|
Jun 21 2005 |
|
|
|
|
|
|
Simple extractors for all min-entropies and a new pseudorandom generator
Shaltiel R., Umans C. Journal of the ACM 52(2): 172-216, 2005. Type: Article
This paper continues an investigation into constructions of extractors and pseudorandom number generators (PNGs). The authors present a simple GF(q)[x] polynomial-based unified a...
|
Jun 21 2005 |
|
|
|
|
|
|
Processing XML streams with deterministic automata and stream indexes
Green T., Gupta A., Miklau G., Onizuka M., Suciu D. ACM Transactions on Database Systems 29(4): 752-788, 2004. Type: Article
This paper examines the growth in number of states of a deterministic finite automaton (DFA) used to parse sets of linear XPath expressions in dealing with large workloads associated with Extensible Markup Language (XML) streams. Also ...
|
Mar 7 2005 |
|
|
|
|
|
|
Processing XML streams with deterministic automata and stream indexes
Green T., Gupta A., Miklau G., Onizuka M., Suciu D. ACM Transactions on Database Systems 29(4): 752-788, 2004. Type: Article
This paper examines the growth in number of states of a deterministic finite automaton (DFA) used to parse sets of linear XPath expressions in dealing with large workloads associated with Extensible Markup Language (XML) streams. Also ...
|
Mar 7 2005 |
|
|
|
|
|
|
Minimal DFA for testing divisibility
Alexeev B. Journal of Computer and System Sciences 69(2): 235-243, 2004. Type: Article
This paper presents a solution to the question of the size fb(k) of the minimal deterministic finite automaton (DFA) accepting the strings in base b that denote integers divisible by
|
Feb 10 2005 |
|
|
|
|
|
|
Minimal DFA for testing divisibility
Alexeev B. Journal of Computer and System Sciences 69(2): 235-243, 2004. Type: Article
This paper presents a solution to the question of the size fb(k) of the minimal deterministic finite automaton (DFA) accepting the strings in base b that denote integers divisible by
|
Feb 10 2005 |
|
|
|
|
|
|
Noisy Chinese remaindering in the Lee norm
Shparlinski I., Steinfeld R. Journal of Complexity 20(2-3): 423-437, 2004. Type: Article
This paper investigates an application of lattice reduction (closet lattice vector) to recovering information from noisy Chinese remainder codes (CRC). The model studied in this paper involves the following parameters: a list of primes...
|
Nov 15 2004 |
|
|
|
|
|
|
Noisy Chinese remaindering in the Lee norm
Shparlinski I., Steinfeld R. Journal of Complexity 20(2-3): 423-437, 2004. Type: Article
This paper investigates an application of lattice reduction (closet lattice vector) to recovering information from noisy Chinese remainder codes (CRC). The model studied in this paper involves the following parameters: a list of primes...
|
Nov 15 2004 |
|
|
|
|
|
| |
|
|
| |
|
|
