Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Jeffrey Shallit
Jeffrey O. Shallit
2010 – today
- 2013
[j86]Alexander Leong, Jeffrey Shallit: Counting Sequences with Small Discrepancies. Experimental Mathematics 22(1): 74-84 (2013)
[j85]Hamoon Mousavi, Jeffrey Shallit: Filtrations of Formal Languages by Arithmetic Progressions. Fundam. Inform. 123(2): 135-142 (2013)
[c50]
[c49]Daniel Goc, Luke Schaeffer, Jeffrey Shallit: Subword Complexity and k-Synchronization. Developments in Language Theory 2013: 252-263
[c48]Hamoon Mousavi, Jeffrey Shallit: Repetition Avoidance in Circular Factors. Developments in Language Theory 2013: 384-395
[c47]Daniel Goc, Hamoon Mousavi, Jeffrey Shallit: On the Number of Unbordered Factors. LATA 2013: 299-310
[c46]Daniel Goc, Kalle Saari, Jeffrey Shallit: Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences. LATA 2013: 311-322
[i42]Hamoon Mousavi, Jeffrey Shallit: Shortest Repetition-Free Words Accepted by Automata. CoRR abs/1304.2959 (2013)
[i41]Shuo Tan, Jeffrey Shallit: Sets Represented as the Length-n Factors of a Word. CoRR abs/1304.3666 (2013)- 2012
[j84]Chiara Epifanio, Christiane Frougny, Alessandra Gabriele, Filippo Mignosi, Jeffrey Shallit: Sturmian graphs and integer representations over numeration systems. Discrete Applied Mathematics 160(4-5): 536-547 (2012)
[j83]Narad Rampersad, Jeffrey Shallit, Zhi Xu: The Computational Complexity of Universality Problems for Prefixes, Suffixes, Factors, and Subwords of Regular Languages. Fundam. Inform. 116(1-4): 223-236 (2012)
[j82]Emilie Charlier, Narad Rampersad, Jeffrey Shallit: Enumeration and Decidable Properties of Automatic Sequences. Int. J. Found. Comput. Sci. 23(5): 1035-1066 (2012)
[j81]Luke Schaeffer, Jeffrey Shallit: The Critical Exponent is Computable for Automatic Sequences. Int. J. Found. Comput. Sci. 23(8): 1611-1626 (2012)
[j80]Jeffrey Shallit: Review of finite fields and applications by Gary L. Mullen and Carl Mummert. SIGACT News 43(1): 30-31 (2012)
[j79]Jeffrey Shallit: Review of biscuits of number theory by Arthur T. Benjamin and Ezra Brown. SIGACT News 43(2): 21-24 (2012)
[c45]Galina Jirásková, Jeffrey Shallit: The State Complexity of Star-Complement-Star. Developments in Language Theory 2012: 380-391
[c44]
[c43]Daniel Goc, Dane Henshall, Jeffrey Shallit: Automatic Theorem-Proving in Combinatorics on Words. CIAA 2012: 180-191
[i40]Dane Henshall, Jeffrey Shallit: Automatic Theorem-Proving in Combinatorics on Words. CoRR abs/1203.3758 (2012)
[i39]Galina Jirásková, Jeffrey Shallit: The state complexity of star-complement-star. CoRR abs/1203.5353 (2012)
[i38]Hermann Gruber, Jonathan Lee, Jeffrey Shallit: Enumerating regular expressions and their languages. CoRR abs/1204.4982 (2012)
[i37]Daniel Goc, Luke Schaeffer, Jeffrey Shallit: The Subword Complexity of k-Automatic Sequences is k-Synchronized. CoRR abs/1206.5352 (2012)
[i36]Daniel Goc, Jeffrey Shallit: Primitive Words and Lyndon Words in Automatic Sequences. CoRR abs/1207.5124 (2012)
[i35]
[i34]Daniel Goc, Hamoon Mousavi, Jeffrey Shallit: On the Number of Unbordered Factors. CoRR abs/1211.1301 (2012)
[i33]Hamoon Mousavi, Jeffrey Shallit: Repetition Avoidance in Circular Factors. CoRR abs/1212.0052 (2012)- 2011
[j78]Michael Coons, Jeffrey Shallit: A pattern sequence approach to Stern's sequence. Discrete Mathematics 311(22): 2630-2633 (2011)
[j77]Janusz A. Brzozowski, Jeffrey Shallit, Zhi Xu: Decision problems for convex languages. Inf. Comput. 209(3): 353-367 (2011)
[j76]Janusz A. Brzozowski, Elyot Grant, Jeffrey Shallit: Closures in Formal Languages and Kuratowski's Theorem. Int. J. Found. Comput. Sci. 22(2): 301-321 (2011)
[j75]Narad Rampersad, Jeffrey Shallit, Ming-wei Wang: Inverse star, borders, and palstars. Inf. Process. Lett. 111(9): 420-422 (2011)
[j74]Wesley R. Elsberry, Jeffrey Shallit: Information theory, evolutionary computation, and Dembski's "complex specified information". Synthese 178(2): 237-270 (2011)
[c42]Levent Alpoge, Thomas Ang, Luke Schaeffer, Jeffrey Shallit: Decidability and Shortest Strings in Formal Languages. DCFS 2011: 55-67
[c41]Erik D. Demaine, Sarah Eisenstat, Jeffrey Shallit, David A. Wilson: Remarks on Separating Words. DCFS 2011: 147-157
[c40]Emilie Charlier, Narad Rampersad, Jeffrey Shallit: Enumeration and Decidable Properties of Automatic Sequences. Developments in Language Theory 2011: 165-179
[c39]
[c38]Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey Shallit: Finite Orbits of Language Operations. LATA 2011: 204-215
[c37]
[c36]
[i32]Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey Shallit: Finite Orbits of Language Operations. CoRR abs/1101.1667 (2011)
[i31]Emilie Charlier, Narad Rampersad, Jeffrey Shallit: Enumeration and Decidable Properties of Automatic Sequences. CoRR abs/1102.3698 (2011)
[i30]
[i29]Jean-Paul Allouche, Jeffrey Shallit: A variant of Hofstadter's sequence and finite automata. CoRR abs/1103.1133 (2011)
[i28]Levent Alpoge, Thomas Ang, Luke Schaeffer, Jeffrey Shallit: Decidability and Shortest Strings in Formal Languages. CoRR abs/1103.1622 (2011)
[i27]Erik D. Demaine, Sarah Eisenstat, Jeffrey Shallit, David A. Wilson: Remarks on separating words. CoRR abs/1103.4513 (2011)
[i26]Michael Coons, Jeffrey Shallit: A Pattern Sequence Approach to Stern's Sequence. CoRR abs/1105.0086 (2011)
[i25]Julien Cassaigne, James D. Currie, Luke Schaeffer, Jeffrey Shallit: Avoiding Three Consecutive Blocks of the Same Size and Same Sum. CoRR abs/1106.5204 (2011)
[i24]
[i23]
[i22]Hamoon Mousavi, Jeffrey Shallit: Filtrations of Formal Languages by Arithmetic Progressions. CoRR abs/1112.3758 (2011)- 2010
[j73]Pawel Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey Shallit: Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time. Int. J. Found. Comput. Sci. 21(4): 597-618 (2010)
[j72]Narad Rampersad, Jeffrey Shallit: Detecting patterns in finite regular and context-free languages. Inf. Process. Lett. 110(3): 108-112 (2010)
[j71]Jeffrey Shallit: Cryptographic applications of analytic number theory: lower bounds and pseudorandomness author of book: Igor Shparlinski Birkäuser, 2003. SIGACT News 41(3): 44-45 (2010)
[c35]Chiara Epifanio, Christiane Frougny, Alessandra Gabriele, Filippo Mignosi, Jeffrey Shallit: On Lazy Representations and Sturmian Graphs. CIAA 2010: 125-134
[i21]Narad Rampersad, Jeffrey Shallit, Ming-wei Wang: Inverse Star, Borders, and Palstars. CoRR abs/1008.2440 (2010)
2000 – 2009
- 2009
[j70]
[j69]
[j68]Mathieu Guay-Paquet, Jeffrey Shallit: Avoiding squares and overlaps over the natural numbers. Discrete Mathematics 309(21): 6245-6254 (2009)
[j67]Terry Anderson, John Loftus, Narad Rampersad, Nicolae Santean, Jeffrey Shallit: Detecting palindromes, patterns and borders in regular languages. Inf. Comput. 207(11): 1096-1118 (2009)
[j66]Dalia Krieger, Avery Miller, Narad Rampersad, Bala Ravikumar, Jeffrey Shallit: Decimations of languages and state complexity. Theor. Comput. Sci. 410(24-25): 2401-2409 (2009)
[j65]Narad Rampersad, Nicolae Santean, Jeffrey Shallit, Bala Ravikumar: State complexity of unique rational operations. Theor. Comput. Sci. 410(24-25): 2431-2441 (2009)
[j64]Jean-Paul Allouche, Narad Rampersad, Jeffrey Shallit: Periodicity, repetitions, and orbits of an automatic sequence. Theor. Comput. Sci. 410(30-32): 2795-2803 (2009)
[j63]Margareta Ackerman, Jeffrey Shallit: Efficient enumeration of words in regular languages. Theor. Comput. Sci. 410(37): 3461-3470 (2009)
[j62]Jui-Yi Kao, Narad Rampersad, Jeffrey Shallit: On NFAs where all states are final, initial, or both. Theor. Comput. Sci. 410(47-49): 5010-5021 (2009)
[c34]Janusz A. Brzozowski, Elyot Grant, Jeffrey Shallit: Closures in Formal Languages and Kuratowski's Theorem. Developments in Language Theory 2009: 125-144
[c33]Janusz A. Brzozowski, Jeffrey Shallit, Zhi Xu: Decision Problems for Convex Languages. LATA 2009: 247-258
[i20]Janusz A. Brzozowski, Elyot Grant, Jeffrey Shallit: Closures in Formal Languages and Kuratowski's Theorem. CoRR abs/0901.3761 (2009)
[i19]Janusz A. Brzozowski, Elyot Grant, Jeffrey Shallit: Closures in Formal Languages: Concatenation, Separation, and Algorithms. CoRR abs/0901.3763 (2009)
[i18]Narad Rampersad, Jeffrey Shallit: Detecting patterns in finite regular and context-free languages. CoRR abs/0906.3220 (2009)
[i17]Narad Rampersad, Jeffrey Shallit, Zhi Xu: The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages. CoRR abs/0907.0159 (2009)
[i16]Thomas Ang, Jeffrey Shallit: Length of the Shortest Word in the Intersection of Regular Languages. CoRR abs/0910.1528 (2009)
[i15]Thomas Ang, Giovanni Pighizzini, Narad Rampersad, Jeffrey Shallit: Automata and Reduced Words in the Free Group. CoRR abs/0910.4555 (2009)- 2008
[b2]Jeffrey O. Shallit: A Second Course in Formal Languages and Automata Theory. Cambridge University Press 2008, ISBN 978-0-521-86572-2, pp. I-XI, 1-240
[j61]Pascal Ochem, Narad Rampersad, Jeffrey Shallit: Avoiding Approximate Squares. Int. J. Found. Comput. Sci. 19(3): 633-648 (2008)
[j60]Jui-Yi Kao, Narad Rampersad, Jeffrey Shallit, Manuel Silva: Words avoiding repetitions in arithmetic progressions. Theor. Comput. Sci. 391(1-2): 126-137 (2008)
[c32]Jeffrey Shallit: The Frobenius Problem and Its Generalizations. Developments in Language Theory 2008: 72-83
[c31]Pawel Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey Shallit: Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time. Developments in Language Theory 2008: 339-358
[c30]Terry Anderson, Narad Rampersad, Nicolae Santean, Jeffrey Shallit: Finite Automata, Palindromes, Powers, and Patterns. LATA 2008: 52-63
[c29]
[i14]Zhi Xu, Jeffrey Shallit: An NP-hardness Result on the Monoid Frobenius Problem. CoRR abs/0805.4049 (2008)
[i13]Jean-Paul Allouche, Narad Rampersad, Jeffrey Shallit: Periodicity, repetitions, and orbits of an automatic sequence. CoRR abs/0808.1657 (2008)
[i12]Janusz A. Brzozowski, Jeffrey Shallit, Zhi Xu: Decision Problems For Convex Languages. CoRR abs/0808.1928 (2008)
[i11]Jui-Yi Kao, Andrew J. Malton, Narad Rampersad, Jeffrey Shallit: On NFAs Where All States are Final, Initial, or Both. CoRR abs/0808.2417 (2008)- 2007
[j59]Chiara Epifanio, Filippo Mignosi, Jeffrey Shallit, Ilaria Venturini: On Sturmian graphs. Discrete Applied Mathematics 155(8): 1014-1030 (2007)
[j58]Michael Domaratzki, Alexander Okhotin, Jeffrey Shallit: Enumeration of Context-Free Languages and Related Structures. Journal of Automata, Languages and Combinatorics 12(1-2): 79-95 (2007)
[j57]Dalia Krieger, Jeffrey Shallit: Every real number greater than 1 is a critical exponent. Theor. Comput. Sci. 381(1-3): 177-182 (2007)
[c28]Dalia Krieger, Pascal Ochem, Narad Rampersad, Jeffrey Shallit: Avoiding Approximate Squares. Developments in Language Theory 2007: 278-289
[c27]
[i10]Jui-Yi Kao, Jeffrey Shallit, Zhi Xu: The Frobenius Problem in a Free Monoid. CoRR abs/0708.3224 (2007)
[i9]Terry Anderson, Narad Rampersad, Nicolae Santean, Jeffrey Shallit: Finite automata, palindromes, patterns, and borders. CoRR abs/0711.3183 (2007)
[i8]Dalia Krieger, Narad Rampersad, Jeffrey Shallit: Finding the growth rate of a regular language in polynomial time. CoRR abs/0711.4990 (2007)- 2006
[j56]James D. Currie, Narad Rampersad, Jeffrey Shallit: Binary Words Containing Infinitely Many Overlaps. Electr. J. Comb. 13(1) (2006)
[j55]Shandy Brown, Narad Rampersad, Jeffrey Shallit, Troy Vasiga: Squares and overlaps in the Thue-Morse sequence and some variants. ITA 40(3): 473-484 (2006)
[c26]- 2005
[j54]Jean-Paul Allouche, Jeffrey Shallit, Guentcho Skordev: Self-generating sets, integers with missing blocks, and substitutions. Discrete Mathematics 292(1-3): 1-15 (2005)
[j53]Bryan Krawetz, John Lawrence, Jeffrey Shallit: State complexity and the monoid of transformations of a finite set. Int. J. Found. Comput. Sci. 16(3): 547-563 (2005)
[j52]Michael Domaratzki, Keith Ellul, Jeffrey Shallit, Ming-wei Wang: Non-uniqueness and radius of cyclic unary NFAs. Int. J. Found. Comput. Sci. 16(5): 883-896 (2005)
[j51]Keith Ellul, Bryan Krawetz, Jeffrey Shallit, Ming-wei Wang: Regular Expressions: New Results and Open Problems. Journal of Automata, Languages and Combinatorics 10(4): 407-437 (2005)
[j50]Narad Rampersad, Jeffrey Shallit, Ming-wei Wang: Avoiding large squares in infinite binary words. Theor. Comput. Sci. 339(1): 19-34 (2005)
[j49]Lucian Ilie, Pascal Ochem, Jeffrey Shallit: A generalization of repetition threshold. Theor. Comput. Sci. 345(2-3): 359-369 (2005)
[c25]Michael Domaratzki, Alexander Okhotin, Jeffrey Shallit: Enumeration of Context-Free Languages and Related Structures. DCFS 2005: 85-96- 2004
[j48]Troy Vasiga, Jeffrey Shallit: On the iteration of certain quadratic maps over GF(p). Discrete Mathematics 277(1-3): 219-240 (2004)
[j47]Jeffrey Shallit: Simultaneous Avoidance Of Large Squares And Fractional Powers In Infinite Binary Words. Int. J. Found. Comput. Sci. 15(2): 317-327 (2004)
[j46]Keith Ellul, Bryan Krawetz, Jeffrey Shallit, Ming-wei Wang: Regular Expressions: New Results and Open Problems. Journal of Automata, Languages and Combinatorics 9(2/3): 233-256 (2004)
[j45]Juhani Karhumäki, Jeffrey Shallit: Polynomial versus exponential growth in repetition-free binary words. J. Comb. Theory, Ser. A 105(2): 335-347 (2004)
[c24]Michael Domaratzki, Keith Ellul, Jeffrey Shallit, Ming-wei Wang: Non-Uniqueness and Radius of Cyclic Unary NFAs. DCFS 2004: 178-190
[c23]Chiara Epifanio, Filippo Mignosi, Jeffrey Shallit, Ilaria Venturini: Sturmian Graphs and a Conjecture of Moser. Developments in Language Theory 2004: 175-187
[c22]Lucian Ilie, Pascal Ochem, Jeffrey Shallit: A Generalization of Repetition Threshold. MFCS 2004: 818-826
[c21]
[c20]Bryan Krawetz, John Lawrence, Jeffrey Shallit: State Complexity and the Monoid of Transformations of a Finite Set. CIAA 2004: 213-224- 2003
[b1]Jean-Paul Allouche, Jeffrey O. Shallit: Automatic Sequences - Theory, Applications, Generalizations. Cambridge University Press 2003, ISBN 978-0-521-82332-6, pp. I-XVI, 1-571
[j44]Sabin Cautis, Filippo Mignosi, Jeffrey Shallit, Ming-wei Wang, Soroosh Yazdani: Periodicity, morphisms, and matrices. Theor. Comput. Sci. 295: 107-121 (2003)
[j43]Jean-Paul Allouche, Jeffrey Shallit: The ring of k-regular sequences, II. Theor. Comput. Sci. 307(1): 3-29 (2003)
[i7]Narad Rampersad, Jeffrey Shallit, Ming-wei Wang: Cubefree binary words avoiding long squares. CoRR math.CO/0302303 (2003)
[i6]Juhani Karhumäki, Jeffrey Shallit: Polynomial versus Exponential Growth in Repetition-Free Binary Words. CoRR math.CO/0304095 (2003)
[i5]Jeffrey Shallit: Simultaneous avoidance of large squares and fractional powers in infinite binary words. CoRR math.CO/0304476 (2003)
[i4]Narad Rampersad, Jeffrey Shallit, Ming-wei Wang: Avoiding large squares in infinite binary words. CoRR math.CO/0306081 (2003)
[i3]- 2002
[j42]John A. Ellis, Hongbing Fan, Jeffrey Shallit: The Cycles of the Multiway Perfect Shuffle Permutation. Discrete Mathematics & Theoretical Computer Science 5(1): 169-180 (2002)
[j41]Giovanni Pighizzini, Jeffrey Shallit: Unary Language Operations, State Complexity and Jacobsthal's Function. Int. J. Found. Comput. Sci. 13(1): 145-159 (2002)
[j40]Michael Domaratzki, Giovanni Pighizzini, Jeffrey Shallit: Simulating finite automata with context-free grammars. Inf. Process. Lett. 84(6): 339-344 (2002)
[j39]Michael Domaratzki, Derek Kisman, Jeffrey Shallit: On the Number of Distinct Languages Accepted by Finite Automata with n States. Journal of Automata, Languages and Combinatorics 7(4): 469-486 (2002)
[j38]Giovanni Pighizzini, Jeffrey Shallit, Ming-wei Wang: Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds. J. Comput. Syst. Sci. 65(2): 393-414 (2002)
[j37]Jeffrey Shallit: The computational complexity of the local postage stamp problem. SIGACT News 33(1): 90-94 (2002)
[j36]Jeffrey Shallit, Ming-wei Wang: On two-sided infinite fixed points of morphisms. Theor. Comput. Sci. 270(1-2): 659-675 (2002)
[c19]Keith Ellul, Jeffrey Shallit, Ming-wei Wang: Regular Expressions: New Results and Open Problems. DCFS 2002: 17-34- 2001
[j35]Jeffrey Shallit, Ming-wei Wang: Weakly Self-Avoiding Words and a Construction of Friedman. Electr. J. Comb. 8(1) (2001)
[j34]Jeffrey Shallit, Ming-wei Wang: Automatic Complexity of Strings. Journal of Automata, Languages and Combinatorics 6(4): 537-554 (2001)
[c18]Michael Domaratzki, Derek Kisman, Jeffrey Shallit: On the Number of Distinct Languages Accepted by Finite Automata with n States. DCFS 2001: 67-78
[c17]Michael Domaratzki, Jeffrey Shallit, Sheng Yu: Minimal Covers of Formal Languages. Developments in Language Theory 2001: 319-329
[c16]Filippo Mignosi, Jeffrey Shallit, Ming-wei Wang: Variations on a Theorem of Fine & Wilf. MFCS 2001: 512-523
[i2]Jeffrey Shallit: The computational complexity of the local postage stamp problem. CoRR math.NT/0112257 (2001)- 2000
[j33]Jean-Paul Allouche, Jeffrey Shallit: Sums of Digits, Overlaps, and Palindromes. Discrete Mathematics & Theoretical Computer Science 4(1): 1-10 (2000)
[j32]Jeffrey Shallit: Automaticity and Rationality. Journal of Automata, Languages and Combinatorics 5(3): 255-268 (2000)
[c15]
1990 – 1999
- 1999
[j31]James D. Currie, Holger Petersen, John Michael Robson, Jeffrey Shallit: Separating Words with Small Grammars. Journal of Automata, Languages and Combinatorics 4(2): 101-110 (1999)
[j30]Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey Shallit: The Computational Complexity of Some Problems of Linear Algebra. J. Comput. Syst. Sci. 58(3): 572-596 (1999)
[c14]John Loftus, Jeffrey Shallit, Ming-wei Wang: New problems of pattern avoidance. Developments in Language Theory 1999: 185-199
[c13]
[c12]Jeffrey Shallit, David Swart: An Efficient Algorithm for Computing the ith letter of 4na. SODA 1999: 768-775- 1998
[j29]Ian Glaister, Jeffrey Shallit: Automaticity III: Polynomial Automaticity and Context-Free Languages. Computational Complexity 7(4): 371-387 (1998)
[j28]Jean-Paul Allouche, James D. Currie, Jeffrey Shallit: Extremal Infinite Overlap-Free Binary Words. Electr. J. Comb. 5 (1998)
[j27]Ming-wei Wang, Jeffrey Shallit: On Minimal Words With Given Subword Complexity. Electr. J. Comb. 5 (1998)
[j26]Jean-Paul Allouche, Jeffrey Shallit: Generalized Perturbed Symmetry. Eur. J. Comb. 19(4): 401-411 (1998)- 1997
[j25]Jean-Paul Allouche, E. Cateland, W. J. Gilbert, Heinz-Otto Peitgen, Jeffrey Shallit, Guentcho Skordev: Automatic Maps in Exotic Numeration System. Theory Comput. Syst. 30(3): 285-331 (1997)
[j24]Carl Pomerance, John Michael Robson, Jeffrey Shallit: Automaticity II: Descriptional Complexity in the Unary Case. Theor. Comput. Sci. 180(1-2): 181-201 (1997)
[j23]Jeffrey Shallit, Harriet Lyons: Social Issues in Canada's Information Society. Inf. Soc. 13(2): 147-151 (1997)
[c11]Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey Shallit: The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract). STACS 1997: 451-462
[i1]Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey Shallit: The Computational Complexity of Some Problems of Linear Algebra. Electronic Colloquium on Computational Complexity (ECCC) 4(9) (1997)- 1996
[j22]Ian Glaister, Jeffrey Shallit: A Lower Bound Technique for the Size of Nondeterministic Finite Automata. Inf. Process. Lett. 59(2): 75-77 (1996)
[j21]Jeffrey Shallit, Yuri Breitbart: Automaticity I: Properties of a Measure of Descriptional Complexity. J. Comput. Syst. Sci. 53(1): 10-25 (1996)
[j20]Eric Bach, Richard F. Lukes, Jeffrey Shallit, Hugh C. Williams: Results and estimates on pseudopowers. Math. Comput. 65(216): 1737-1747 (1996)
[j19]Siegfried Lehr, Jeffrey Shallit, John Tromp: On the Vector Space of the Automatic Reals. Theor. Comput. Sci. 163(1&2): 193-210 (1996)
[c10]Ian Glaister, Jeffrey Shallit: Polynomial Automaticity, Context-Free Languages, and Fixed Points of Morphism (Extended Abstract). MFCS 1996: 382-393- 1995
[j18]John Tromp, Jeffrey Shallit: Subword Complexity of a Generalized Thue-Morse Word. Inf. Process. Lett. 54(6): 313-316 (1995)- 1994
[j17]Per Enflo, Andrew Granville, Jeffrey Shallit, Sheng Yu: on Sparse Languages L such that LL = Sigma. Discrete Applied Mathematics 52(3): 275-285 (1994)
[j16]Jeffrey Shallit: Numeration Systems, Linear Recurrences, and Regular Sets. Inf. Comput. 113(2): 331-347 (1994)
[j15]Jeffrey Shallit, Jonathan P. Sorenson: Analysis of a Left-Shift Binary GCD Algorithm. J. Symb. Comput. 17(6): 473-486 (1994)
[c9]Jeffrey Shallit, Jonathan P. Sorenson: Analysis of a left-shift binary GCD algorithm. ANTS 1994: 169-183
[c8]Jeffrey Shallit, Yuri Breitbart: Automaticity: Properties of a Measure of Descriptional Complexity. STACS 1994: 619-630- 1993
[j14]Jeffrey Shallit: On the maximum number of distinct factors of a binary string. Graphs and Combinatorics 9(2-4): 197-200 (1993)
[j13]Eric Bach, James R. Driscoll, Jeffrey Shallit: Factor Refinement. J. Algorithms 15(2): 199-222 (1993)- 1992
[j12]Jeffrey Shallit, David A. Wilson: The "3x + 1" Problem and Finite Automata. Bulletin of the EATCS 46: 182-185 (1992)
[j11]Jean-Paul Allouche, Patrick Morton, Jeffrey Shallit: Pattern Spectra, Substring Enumeration, and Automatic Sequences. Theor. Comput. Sci. 94(2): 161-174 (1992)
[j10]Jean-Paul Allouche, Jeffrey Shallit: The Ring of k-Regular Sequences. Theor. Comput. Sci. 98(2): 163-197 (1992)
[c7]Jeffrey Shallit: Numeration Systems, Linear Recurrences, and Regular Sets (Extended Abstract). ICALP 1992: 89-100
[c6]Andrew Szilard, Sheng Yu, Kaizhong Zhang, Jeffrey Shallit: Characterizing Regular Languages with Polynomial Densities. MFCS 1992: 494-503- 1990
[j9]Jeffrey Shallit: On the Worst Case of Three Algorithms for Computing the Jacobi Symbol. J. Symb. Comput. 10(6): 593-610 (1990)
[c5]
[c4]
1980 – 1989
- 1989
[j8]Jeffrey Shallit, Jorge Stolfi: Two methods for generating fractals. Computers & Graphics 13(2): 185-191 (1989)
[j7]Jean-Paul Allouche, J. Bétréma, Jeffrey Shallit: Sur Des Points Fixes De Morphismes D'Un Monoïde Libre. ITA 23(3): 235-249 (1989)
[j6]
[j5]Jean-Paul Allouche, Péter Hajnal, Jeffrey Shallit: Analysis of an Infinite Product Algorithm. SIAM J. Discrete Math. 2(1): 1-15 (1989)
[c3]- 1988
[j4]David Rubinstein, Jeffrey Shallit, Mario Szegedy: A Subset Coloring Algorithm and Its Applications to Computer Graphics. Commun. ACM 31(10): 1228-1232 (1988)
[j3]- 1986
[j2]Eric Bach, Gary L. Miller, Jeffrey Shallit: Sums of Divisors, Perfect Numbers and Factoring. SIAM J. Comput. 15(4): 1143-1154 (1986)- 1985
[j1]Jeffrey Shallit, Adi Shamir: Number-Theoretic Functions Which Are Equivalent to Number of Divisors. Inf. Process. Lett. 20(3): 151-153 (1985)
[c2]- 1984
[c1]Eric Bach, Gary L. Miller, Jeffrey Shallit: Sums of Divisors, Perfect Numbers, and Factoring (Extended Abstract). STOC 1984: 183-190
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-11 21:48 CEST by the dblp team



