Search the dblp DataBase
Jeffrey Shallit :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Jeffrey Shallit , Jonathan Sorenson Analysis of a left-shift binary GCD algorithm. [Citation Graph (0, 0)][DBLP ] ANTS, 1994, pp:169-183 [Conf ] Michael Domaratzki , Jeffrey Shallit , Sheng Yu Minimal Covers of Formal Languages. [Citation Graph (0, 0)][DBLP ] Developments in Language Theory, 2001, pp:319-329 [Conf ] Chiara Epifanio , Filippo Mignosi , Jeffrey Shallit , Ilaria Venturini Sturmian Graphs and a Conjecture of Moser. [Citation Graph (0, 0)][DBLP ] Developments in Language Theory, 2004, pp:175-187 [Conf ] John Loftus , Jeffrey Shallit , Ming-wei Wang New problems of pattern avoidance. [Citation Graph (0, 0)][DBLP ] Developments in Language Theory, 1999, pp:185-199 [Conf ] Jeffrey Shallit , Ming-wei Wang On Two-Sided Infinite Fixed Points of Morphisms. [Citation Graph (0, 0)][DBLP ] FCT, 1999, pp:488-499 [Conf ] Eric Bach , Jeffrey Shallit Factoring with Cyclotomic Polynomials [Citation Graph (0, 0)][DBLP ] FOCS, 1985, pp:443-450 [Conf ] Jeffrey Shallit Numeration Systems, Linear Recurrences, and Regular Sets (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ICALP, 1992, pp:89-100 [Conf ] Ian Glaister , Jeffrey Shallit Polynomial Automaticity, Context-Free Languages, and Fixed Points of Morphism (Extended Abstract). [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:382-393 [Conf ] Lucian Ilie , Pascal Ochem , Jeffrey Shallit A Generalization of Repetition Threshold. [Citation Graph (0, 0)][DBLP ] MFCS, 2004, pp:818-826 [Conf ] Filippo Mignosi , Jeffrey Shallit , Ming-wei Wang Variations on a Theorem of Fine & Wilf. [Citation Graph (0, 0)][DBLP ] MFCS, 2001, pp:512-523 [Conf ] Andrew Szilard , Sheng Yu , Kaizhong Zhang , Jeffrey Shallit Characterizing Regular Languages with Polynomial Densities. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:494-503 [Conf ] Eric Bach , James R. Driscoll , Jeffrey Shallit Factor Refinement. [Citation Graph (0, 0)][DBLP ] SODA, 1990, pp:201-211 [Conf ] Jeffrey Shallit , David Swart An Efficient Algorithm for Computing the i th letter of 4n a. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:768-775 [Conf ] Jean-Paul Allouche , Jeffrey Shallit The Ring of k-Regular Sequences. [Citation Graph (0, 0)][DBLP ] STACS, 1990, pp:12-23 [Conf ] Jonathan F. Buss , Gudmund Skovbjerg Frandsen , Jeffrey Shallit The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract). [Citation Graph (0, 0)][DBLP ] STACS, 1997, pp:451-462 [Conf ] Jeffrey Shallit A Generalization of Automatic Sequences. [Citation Graph (0, 0)][DBLP ] STACS, 1989, pp:156-167 [Conf ] Jeffrey Shallit , Yuri Breitbart Automaticity: Properties of a Measure of Descriptional Complexity. [Citation Graph (0, 0)][DBLP ] STACS, 1994, pp:619-630 [Conf ] Eric Bach , Gary L. Miller , Jeffrey Shallit Sums of Divisors, Perfect Numbers, and Factoring (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1984, pp:183-190 [Conf ] Bryan Krawetz , John Lawrence , Jeffrey Shallit State Complexity and the Monoid of Transformations of a Finite Set. [Citation Graph (0, 0)][DBLP ] CIAA, 2004, pp:213-224 [Conf ] Jonathan Lee , Jeffrey Shallit Enumerating Regular Expressions and Their Languages. [Citation Graph (0, 0)][DBLP ] CIAA, 2004, pp:2-22 [Conf ] Jeffrey Shallit State Complexity and Jacobsthal's Function. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:272-278 [Conf ] David Rubinstein , Jeffrey Shallit , Mario Szegedy A Subset Coloring Algorithm and Its Applications to Computer Graphics. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1988, v:31, n:10, pp:1228-1232 [Journal ] Ian Glaister , Jeffrey Shallit Automaticity III: Polynomial Automaticity and Context-Free Languages. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1998, v:7, n:4, pp:371-387 [Journal ] Jeffrey Shallit , Jorge Stolfi Two methods for generating fractals. [Citation Graph (0, 0)][DBLP ] Computers & Graphics, 1989, v:13, n:2, pp:185-191 [Journal ] Jean-Paul Allouche , James D. Currie , Jeffrey Shallit Extremal Infinite Overlap-Free Binary Words. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 1998, v:5, n:, pp:- [Journal ] Jeffrey Shallit , Ming-wei Wang Weakly Self-Avoiding Words and a Construction of Friedman. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal ] Ming-wei Wang , Jeffrey Shallit On Minimal Words With Given Subword Complexity. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 1998, v:5, n:, pp:- [Journal ] Narad Rampersad , Jeffrey Shallit , Ming-wei Wang Cubefree binary words avoiding long squares [Citation Graph (0, 0)][DBLP ] CoRR, 2003, v:0, n:, pp:- [Journal ] Juhani Karhumäki , Jeffrey Shallit Polynomial versus Exponential Growth in Repetition-Free Binary Words [Citation Graph (0, 0)][DBLP ] CoRR, 2003, v:0, n:, pp:- [Journal ] Jeffrey Shallit Simultaneous avoidance of large squares and fractional powers in infinite binary words [Citation Graph (0, 0)][DBLP ] CoRR, 2003, v:0, n:, pp:- [Journal ] Narad Rampersad , Jeffrey Shallit , Ming-wei Wang Avoiding large squares in infinite binary words [Citation Graph (0, 0)][DBLP ] CoRR, 2003, v:0, n:, pp:- [Journal ] Lucian Ilie , Jeffrey Shallit A Generalization of Repetition Threshold [Citation Graph (0, 0)][DBLP ] CoRR, 2003, v:0, n:, pp:- [Journal ] Jeffrey Shallit The computational complexity of the local postage stamp problem [Citation Graph (0, 0)][DBLP ] CoRR, 2001, v:0, n:, pp:- [Journal ] Per Enflo , Andrew Granville , Jeffrey Shallit , Sheng Yu on Sparse Languages L such that LL = Sigma. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:52, n:3, pp:275-285 [Journal ] Chiara Epifanio , Filippo Mignosi , Jeffrey Shallit , Ilaria Venturini On Sturmian graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2007, v:155, n:8, pp:1014-1030 [Journal ] Jean-Paul Allouche , Jeffrey Shallit , Guentcho Skordev Self-generating sets, integers with missing blocks, and substitutions. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2005, v:292, n:1-3, pp:1-15 [Journal ] Troy Vasiga , Jeffrey Shallit On the iteration of certain quadratic maps over GF(p ). [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:277, n:1-3, pp:219-240 [Journal ] Jean-Paul Allouche , Jeffrey Shallit Sums of Digits, Overlaps, and Palindromes. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics & Theoretical Computer Science, 2000, v:4, n:1, pp:1-10 [Journal ] John A. Ellis , Hongbing Fan , Jeffrey Shallit The Cycles of the Multiway Perfect Shuffle Permutation. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics & Theoretical Computer Science, 2002, v:5, n:1, pp:169-180 [Journal ] Jeffrey Shallit , David Wilson The "3x + 1" Problem and Finite Automata. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 1992, v:46, n:, pp:182-185 [Journal ] Jonathan F. Buss , Gudmund Skovbjerg Frandsen , Jeffrey Shallit The Computational Complexity of Some Problems of Linear Algebra [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:9, pp:- [Journal ] Jean-Paul Allouche , Jeffrey Shallit Generalized Perturbed Symmetry. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 1998, v:19, n:4, pp:401-411 [Journal ] Jeffrey Shallit Numeration Systems, Linear Recurrences, and Regular Sets [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1994, v:113, n:2, pp:331-347 [Journal ] Michael Domaratzki , Keith Ellul , Jeffrey Shallit , Ming-wei Wang Non-uniqueness and radius of cyclic unary NFAs. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:883-896 [Journal ] Bryan Krawetz , John Lawrence , Jeffrey Shallit State complexity and the monoid of transformations of a finite set. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:3, pp:547-563 [Journal ] Giovanni Pighizzini , Jeffrey Shallit Unary Language Operations, State Complexity and Jacobsthal's Function. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2002, v:13, n:1, pp:145-159 [Journal ] Jeffrey Shallit Simultaneous Avoidance Of Large Squares And Fractional Powers In Infinite Binary Words. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2004, v:15, n:2, pp:317-327 [Journal ] Michael Domaratzki , Giovanni Pighizzini , Jeffrey Shallit Simulating finite automata with context-free grammars. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:84, n:6, pp:339-344 [Journal ] Ian Glaister , Jeffrey Shallit A Lower Bound Technique for the Size of Nondeterministic Finite Automata. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1996, v:59, n:2, pp:75-77 [Journal ] Jeffrey Shallit , Adi Shamir Number-Theoretic Functions Which Are Equivalent to Number of Divisors. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1985, v:20, n:3, pp:151-153 [Journal ] John Tromp , Jeffrey Shallit Subword Complexity of a Generalized Thue-Morse Word. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1995, v:54, n:6, pp:313-316 [Journal ] Jean-Paul Allouche , J. Bétréma , Jeffrey Shallit Sur Des Points Fixes De Morphismes D'Un Monoïde Libre. [Citation Graph (0, 0)][DBLP ] ITA, 1989, v:23, n:3, pp:235-249 [Journal ] Eric Bach , James R. Driscoll , Jeffrey Shallit Factor Refinement. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1993, v:15, n:2, pp:199-222 [Journal ] James D. Currie , Holger Petersen , John Michael Robson , Jeffrey Shallit Seperating Words with Small Grammars. [Citation Graph (0, 0)][DBLP ] Journal of Automata, Languages and Combinatorics, 1999, v:4, n:2, pp:101-110 [Journal ] Michael Domaratzki , Derek Kisman , Jeffrey Shallit On the Number of Distinct Languages Accepted by Finite Automata with n States. [Citation Graph (0, 0)][DBLP ] Journal of Automata, Languages and Combinatorics, 2002, v:7, n:4, pp:469-486 [Journal ] Jeffrey Shallit Automaticity and Rationality. [Citation Graph (0, 0)][DBLP ] Journal of Automata, Languages and Combinatorics, 2000, v:5, n:3, pp:255-268 [Journal ] Jeffrey Shallit , Ming-wei Wang Automatic Complexity of Strings. [Citation Graph (0, 0)][DBLP ] Journal of Automata, Languages and Combinatorics, 2001, v:6, n:4, pp:537-554 [Journal ] Jonathan F. Buss , Gudmund Skovbjerg Frandsen , Jeffrey Shallit The Computational Complexity of Some Problems of Linear Algebra. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1999, v:58, n:3, pp:572-596 [Journal ] Giovanni Pighizzini , Jeffrey Shallit , Ming-wei Wang Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2002, v:65, n:2, pp:393-414 [Journal ] Jeffrey Shallit , Yuri Breitbart Automaticity I: Properties of a Measure of Descriptional Complexity. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1996, v:53, n:1, pp:10-25 [Journal ] Michel Mendès France , Jeffrey Shallit Wire bending. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1989, v:50, n:1, pp:1-23 [Journal ] Juhani Karhumäki , Jeffrey Shallit Polynomial versus exponential growth in repetition-free binary words. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 2004, v:105, n:2, pp:335-347 [Journal ] Jeffrey Shallit On the Worst Case of Three Algorithms for Computing the Jacobi Symbol. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 1990, v:10, n:6, pp:593-610 [Journal ] Jeffrey Shallit , Jonathan Sorenson Analysis of a Left-Shift Binary GCD Algorithm. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 1994, v:17, n:6, pp:473-486 [Journal ] Eric Bach , Richard F. Lukes , Jeffrey Shallit , Hugh C. Williams Results and estimates on pseudopowers. [Citation Graph (0, 0)][DBLP ] Math. Comput., 1996, v:65, n:216, pp:1737-1747 [Journal ] Jean-Paul Allouche , E. Cateland , W. J. Gilbert , Heinz-Otto Peitgen , Jeffrey Shallit , Guentcho Skordev Automatic Maps in Exotic Numeration System. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 1997, v:30, n:3, pp:285-331 [Journal ] Eric Bach , Gary L. Miller , Jeffrey Shallit Sums of Divisors, Perfect Numbers and Factoring. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:4, pp:1143-1154 [Journal ] Jean-Paul Allouche , Péter Hajnal , Jeffrey Shallit Analysis of an Infinite Product Algorithm. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1989, v:2, n:1, pp:1-15 [Journal ] Jean-Paul Allouche , Patrick Morton , Jeffrey Shallit Pattern Spectra, Substring Enumeration, and Automatic Sequences. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1992, v:94, n:2, pp:161-174 [Journal ] Jean-Paul Allouche , Jeffrey Shallit The ring of k-regular sequences, II. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:307, n:1, pp:3-29 [Journal ] Jean-Paul Allouche , Jeffrey Shallit The Ring of k-Regular Sequences. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1992, v:98, n:2, pp:163-197 [Journal ] Sabin Cautis , Filippo Mignosi , Jeffrey Shallit , Ming-wei Wang , Soroosh Yazdani Periodicity, morphisms, and matrices. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:, pp:107-121 [Journal ] Lucian Ilie , Pascal Ochem , Jeffrey Shallit A generalization of repetition threshold. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:345, n:2-3, pp:359-369 [Journal ] Siegfried Lehr , Jeffrey Shallit , John Tromp On the Vector Space of the Automatic Reals. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1996, v:163, n:1&2, pp:193-210 [Journal ] Carl Pomerance , John Michael Robson , Jeffrey Shallit Automaticity II: Descriptional Complexity in the Unary Case. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1997, v:180, n:1-2, pp:181-201 [Journal ] Narad Rampersad , Jeffrey Shallit , Ming-wei Wang Avoiding large squares in infinite binary words. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:339, n:1, pp:19-34 [Journal ] Jeffrey Shallit A Generalization of Automatic Sequences. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1988, v:61, n:, pp:1-16 [Journal ] Jeffrey Shallit , Ming-wei Wang On two-sided infinite fixed points of morphisms. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:659-675 [Journal ] Jeffrey Shallit , Harriet Lyons Social Issues in Canada's Information Society. [Citation Graph (0, 0)][DBLP ] Inf. Soc., 1997, v:13, n:2, pp:- [Journal ] Dalia Krieger , Pascal Ochem , Narad Rampersad , Jeffrey Shallit Avoiding Approximate Squares. [Citation Graph (0, 0)][DBLP ] Developments in Language Theory, 2007, pp:278-289 [Conf ] Margareta Ackerman , Jeffrey Shallit Efficient Enumeration of Regular Languages. [Citation Graph (0, 0)][DBLP ] CIAA, 2007, pp:226-242 [Conf ] Jui-Yi Kao , Jeffrey Shallit , Zhi Xu The Frobenius Problem in a Free Monoid [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Dalia Krieger , Jeffrey Shallit Every real number greater than 1 is a critical exponent. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:381, n:1-3, pp:177-182 [Journal ] The Frobenius Problem and Its Generalizations. [Citation Graph (, )][DBLP ] Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time. [Citation Graph (, )][DBLP ] Closures in Formal Languages and Kuratowski's Theorem. [Citation Graph (, )][DBLP ] The Frobenius Problem in a Free Monoid. [Citation Graph (, )][DBLP ] Finite Automata, Palindromes, Powers, and Patterns. [Citation Graph (, )][DBLP ] Decision Problems for Convex Languages. [Citation Graph (, )][DBLP ] Binary Words Containing Infinitely Many Overlaps. [Citation Graph (, )][DBLP ] Finite automata, palindromes, patterns, and borders [Citation Graph (, )][DBLP ] Finding the growth rate of a regular language in polynomial time [Citation Graph (, )][DBLP ] An NP-hardness Result on the Monoid Frobenius Problem [Citation Graph (, )][DBLP ] Periodicity, repetitions, and orbits of an automatic sequence [Citation Graph (, )][DBLP ] Decision Problems For Convex Languages [Citation Graph (, )][DBLP ] On NFAs Where All States are Final, Initial, or Both [Citation Graph (, )][DBLP ] Closures in Formal Languages and Kuratowski's Theorem [Citation Graph (, )][DBLP ] Closures in Formal Languages: Concatenation, Separation, and Algorithms [Citation Graph (, )][DBLP ] Detecting patterns in finite regular and context-free languages [Citation Graph (, )][DBLP ] The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages [Citation Graph (, )][DBLP ] Length of the Shortest Word in the Intersection of Regular Languages [Citation Graph (, )][DBLP ] Automata and Reduced Words in the Free Group [Citation Graph (, )][DBLP ] Inverse Star, Borders, and Palstars [Citation Graph (, )][DBLP ] Avoiding squares and overlaps over the natural numbers. [Citation Graph (, )][DBLP ] Hamming distance for conjugates. [Citation Graph (, )][DBLP ] Search in 0.008secs, Finished in 0.012secs