Co-Hypersimple Structures. - Jeffrey B. Remmel (J. Symb. Log., 1976)

Maximal and Cohesive Vector Spaces. - Jeffrey B. Remmel (J. Symb. Log., 1977)

A r-Maximal Vector Space not contained in any Maximal Vector Space. - Jeffrey B. Remmel (J. Symb. Log., 1978)

Recursion Theory on Orderings. I. A Model Theoretic Setting. - George Metakides; Jeffrey B. Remmel (J. Symb. Log., 1979)

R-Maximal Boolean Algebras. - Jeffrey B. Remmel (J. Symb. Log., 1979)

A Combinatorial Interpretation of q-Derangement and q-Laguerre Numbers. - Adriano M. Garsia; Jeffrey B. Remmel (Eur. J. Comb., 1980)

On R.E. and CO-R.E. Vector Spaces with Nonextendible Bases. - Jeffrey B. Remmel (J. Symb. Log., 1980)

Recursion Theory on Orderings. II. - Jeffrey B. Remmel (J. Symb. Log., 1980)

CO-Simple Higher-Order Indecomposable Isols. - Jeffrey B. Remmel; Alfred B. Manaster (Math. Log. Q., 1980)

Partial Orderings of Fixed Finite Dimension: Model Companions and Density. - Alfred B. Manaster; Jeffrey B. Remmel (J. Symb. Log., 1981)

Recursive Isomorphism Types of Recursive Boolean Algebras. - Jeffrey B. Remmel (J. Symb. Log., 1981)

Recursive Boolean Algebras with Recursive Atoms. - Jeffrey B. Remmel (J. Symb. Log., 1981)

Bijective Proofs of Some Classical Partition Identities. - Jeffrey B. Remmel (J. Comb. Theory A, 1982)

A Note on a Recursion for the Number of Derangements. - Jeffrey B. Remmel (Eur. J. Comb., 1983)

A Bijective Proof of the Hook Formula for the Number of Column Strict Tableaux with Bounded Entries. - Jeffrey B. Remmel; Roger Whitney (Eur. J. Comb., 1983)

Degrees of Recursively Enumerable Topological Spaces. - Iraj Kalantari; Jeffrey B. Remmel (J. Symb. Log., 1983)

Indiscernibles and Decidable Models. - Henry A. Kierstead; Jeffrey B. Remmel (J. Symb. Log., 1983)

Multiplying Schur functions. - Jeffrey B. Remmel; Roger Whitney (J. Algorithms, 1984)

The Universal Complementation Property. - Rodney G. Downey; Jeffrey B. Remmel (J. Symb. Log., 1984)

The Universal Splitting Property. II. - Manuel Lerman; Jeffrey B. Remmel (J. Symb. Log., 1984)

Effectively Nowhere Simple Sets. - D. Miller; Jeffrey B. Remmel (J. Symb. Log., 1984)

A Combinatorial View of Andrews' Proof of the L-M-W Conjectures. - Adriano M. Garsia; Jeffrey B. Remmel (Eur. J. Comb., 1985)

Shuffles of permutations and the Kronecker product. - Adriano M. Garsia; Jeffrey B. Remmel (Graphs Comb., 1985)

Generic objects in recursion theory II: Operations on recursive approximation spaces. - Anil Nerode; Jeffrey B. Remmel (Ann. Pure Appl. Log., 1986)

Graph colorings and recursively bounded Π10-classes. - Jeffrey B. Remmel (Ann. Pure Appl. Log., 1986)

Bijections for Cayley trees, spanning trees, and their q-analogues. - Ömer Egecioglu; Jeffrey B. Remmel (J. Comb. Theory A, 1986)

Q-counting rook configurations and a formula of frobenius. - Adriano M. Garsia; Jeffrey B. Remmel (J. Comb. Theory A, 1986)

Complexity theoretic algebra I - vector spaces over finite fields. - Anil Nerode; Jeffrey B. Remmel (SCT, 1987)

The undecidability of the lattice of R.E. closed subsets of an effective topological space. - Sheryl Silibovsky Brady; Jeffrey B. Remmel (Ann. Pure Appl. Log., 1987)

Recursively rigid Boolean algebras. - Jeffrey B. Remmel (Ann. Pure Appl. Log., 1987)

Permutation statistics and (k, l)-hook Schur functions. - Jeffrey B. Remmel (Discret. Math., 1987)

Automorphisms and Recursive Structures. - Rodney G. Downey; Jeffrey B. Remmel (Math. Log. Q., 1987)

Polynomially Grade Logic I: A Graded Version of System T - Anil Nerode; Jeffrey B. Remmel; Andre Scedrov (LICS, 1989)

Classification of Degree Classes Associated with r.e. Subspaces. - Rodney G. Downey; Jeffrey B. Remmel (Ann. Pure Appl. Log., 1989)

Complexity-Theoretic Algebra II: Boolean Algebras. - Anil Nerode; Jeffrey B. Remmel (Ann. Pure Appl. Log., 1989)

A Theory of Nonmonotonic Rule Systems - V. Wiktor Marek; Anil Nerode; Jeffrey B. Remmel (LICS, 1990)

A Theory of Nonmonotonic Rule Systems I. - V. Wiktor Marek; Anil Nerode; Jeffrey B. Remmel (Ann. Math. Artif. Intell., 1990)

The monomial symmetric functions and the Frobenius map. - Ömer Egecioglu; Jeffrey B. Remmel (J. Comb. Theory A, 1990)

Polynomial-Time versus Recursive Models. - Douglas A. Cenzer; Jeffrey B. Remmel (Ann. Pure Appl. Log., 1991)

Brick tabloids and the connection matrices between bases of symmetric functions. - Ömer Egecioglu; Jeffrey B. Remmel (Discret. Appl. Math., 1991)

Pi01-Classes and Rado's Selection Principle. - Carl G. Jockusch Jr.; Andrew E. M. Lewis; Jeffrey B. Remmel (J. Symb. Log., 1991)

Special Rim Hook Tabloids and Some New Multiplicity-Free S-Series. - Jeffrey B. Remmel; Mei Yang 004 (SIAM J. Discret. Math., 1991)

Rule Systems and Well-Orderings. - V. Wiktor Marek; Anil Nerode; Jeffrey B. Remmel (Structural Complexity and Recursion-theoretic methods in Logic-Programming, 1992)

A Theory of Nonmonotonic Rule Systems II. - V. Wiktor Marek; Anil Nerode; Jeffrey B. Remmel (Ann. Math. Artif. Intell., 1992)

Polynomial-Time Abelian Groups. - Douglas A. Cenzer; Jeffrey B. Remmel (Ann. Pure Appl. Log., 1992)

Cancellation Laws for Polynomial-Time p-Isolated Sets. - John N. Crossley; Jeffrey B. Remmel (Ann. Pure Appl. Log., 1992)

How Complicated is the Set of Stable Models of a Recursive Logic Program? - V. Wiktor Marek; Anil Nerode; Jeffrey B. Remmel (Ann. Pure Appl. Log., 1992)

Formulas for the expansion of the Kronecker products S(m, n) * S(1p-r, r) and S(1k2l) * S(1p-r, r). - Jeffrey B. Remmel (Discret. Math., 1992)

Hybrid Systems as Finsler Manifolds: Finite State Control as Approximation to Connections. - Wolf Kohn; Anil Nerode; Jeffrey B. Remmel (Hybrid Systems, 1994)

Controllers as Fixed Points of Set-Valued Operators. - Anil Nerode; Jeffrey B. Remmel; Alexander Yakhnis (Hybrid Systems, 1994)

Feasibly Categorial Models. - Douglas A. Cenzer; Jeffrey B. Remmel (LCC, 1994)

On Logical Constraints in Logic Programming. - V. Wiktor Marek; Anil Nerode; Jeffrey B. Remmel (ILPS Workshop: Constraints and Databases, 1994)

On Speedable and Levelable Vector Spaces. - Frank A. Bäuerle; Jeffrey B. Remmel (Ann. Pure Appl. Log., 1994)

A Context for Belief Revision: Forward Chaining - Normal Nonmonotonic Rule Systems. - V. Wiktor Marek; Anil Nerode; Jeffrey B. Remmel (Ann. Pure Appl. Log., 1994)

The Stable Models of a Predicate Logic Program. - V. Wiktor Marek; Anil Nerode; Jeffrey B. Remmel (J. Log. Program., 1994)

Proofs, programs, and run times. - John N. Crossley; Jeffrey B. Remmel (Methods Log. Comput. Sci., 1994)

Hybrid Systems: Chattering Approximation to Relaxed Controls. - Xiaolin Ge; Wolf Kohn; Anil Nerode; Jeffrey B. Remmel (Hybrid Systems, 1995)

Complexity of Normal Default Logic and Related Modes of Nonmonotonic Reasoning - V. Wiktor Marek; Anil Nerode; Jeffrey B. Remmel (LICS, 1995)

Permutation Enumeration of the Symmetric Group and the Combinatorics of Symmetric Functions. - Desiree A. Beck; Jeffrey B. Remmel (J. Comb. Theory A, 1995)

A Combinatorial Proof of the Equivalence of the Classical and Combinatorial Definitions of Schur Function. - Joaquin O. Carbonara; Jeffrey B. Remmel; Andrius Kulikauskas (J. Comb. Theory A, 1995)

Feasible Graphs and Colorings. - Jeffrey B. Remmel; Douglas A. Cenzer (Math. Log. Q., 1995)

Viability in Hybrid Systems. - Wolf Kohn; Anil Nerode; Jeffrey B. Remmel; Alexander Yakhnis (Theor. Comput. Sci., 1995)

Agent Based Velocity Control of Highway Systems. - Wolf Kohn; Anil Nerode; Jeffrey B. Remmel (Hybrid Systems, 1996)

Hybrid System Games: Extraction of Control Automata with Small Topologies. - Anil Nerode; Jeffrey B. Remmel; Alexander Yakhnis (Hybrid Systems, 1996)

On the Complexity of Abduction. - V. Wiktor Marek; Anil Nerode; Jeffrey B. Remmel (LICS, 1996)

Nonmonotonic Rule Systems: Foward Chaining, Constraints, and Complexity (Abstract). - Jeffrey B. Remmel (MFCS, 1996)

On the Lattices of NP-Subspaces of a Polynomial Time Vector Space over a Finite Field. - Anil Nerode; Jeffrey B. Remmel (Ann. Pure Appl. Log., 1996)

McNaughton Games and Extracting Strategies for Concurrent Programs. - Anil Nerode; Jeffrey B. Remmel; Alexander Yakhnis (Ann. Pure Appl. Log., 1996)

The combinatorics of transition matrices between the bases of the symmetric functions and the Bn analogues. - Desiree A. Beck; Jeffrey B. Remmel; Tamsen Whitehead (Discret. Math., 1996)

Combinatorics of theq-Basis of Symmetric Functions. - Arun Ram; Jeffrey B. Remmel; Tamsen Whitehead (J. Comb. Theory A, 1996)

Scalble Data and Sensor Fusion via Multiple Agent Hybrid Systems. - Wolf Kohn; Anil Nerode; Jeffrey B. Remmel (Hybrid Systems, 1997)

Hybrid Dynamic Programming. - Wolf Kohn; Jeffrey B. Remmel (HART, 1997)

Basic Forward Chaining Construction for Logic Programs. - V. Wiktor Marek; Anil Nerode; Jeffrey B. Remmel (LFCS, 1997)

Non-Monotonic Reasoning with Quantified Boolean Constraints. - Ch. Pollet; Jeffrey B. Remmel (LPNMR, 1997)

Nonmonotonic rule systems with recursive sets of restraints. - V. Wiktor Marek; Anil Nerode; Jeffrey B. Remmel (Arch. Math. Log., 1997)

Quasi-Simple Relations in Copies of a Given Recursive Structure. - Christopher J. Ash; Julia F. Knight; Jeffrey B. Remmel (Ann. Pure Appl. Log., 1997)

Complexity of Recursive Normal Default Logic. - V. Wiktor Marek; Anil Nerode; Jeffrey B. Remmel (Fundam. Informaticae, 1997)

Annotated Nonmonotonic Rule Systems. - Anil Nerode; Jeffrey B. Remmel; V. S. Subrahmanian (Theor. Comput. Sci., 1997)

Feasible Graphs with Standard Universe. - Douglas A. Cenzer; Jeffrey B. Remmel (Ann. Pure Appl. Log., 1998)

Preface. - Douglas A. Cenzer; Jeffrey B. Remmel (Ann. Pure Appl. Log., 1998)

Index Sets for Pi01 Classes. - Douglas A. Cenzer; Jeffrey B. Remmel (Ann. Pure Appl. Log., 1998)

Formulas for the expansion of the plethysms s2[S(a, b)] and S2[S(nk)]. - Luisa Carini; Jeffrey B. Remmel (Discret. Math., 1998)

A simple proof of the Littlewood-Richardson rule and applications. - Jeffrey B. Remmel; Mark Shimozono (Discret. Math., 1998)

Hook-Schur Functions Analogues of Littlewood's Identities and their Bijective Proofs. - Mei Yang 004; Jeffrey B. Remmel (Eur. J. Comb., 1998)

Complexity and Categoricity. - Douglas A. Cenzer; Jeffrey B. Remmel (Inf. Comput., 1998)

Locally Determined Logic Programs. - Douglas A. Cenzer; Jeffrey B. Remmel; Amy Vanderbilt (LPNMR, 1999)

Logic Programs, Well-Orderings, and Forward Chaining. - V. Wiktor Marek; Anil Nerode; Jeffrey B. Remmel (Ann. Pure Appl. Log., 1999)

Large-Scale Regularities of Lattice Embeddings of Posets. - Jeffrey B. Remmel; S. Gill Williamson (Order, 1999)

Index Sets in Computable Analysis. - Douglas A. Cenzer; Jeffrey B. Remmel (Theor. Comput. Sci., 1999)

Characterizing the Set of Extensions of a Nonmonotonic Rule System with Levels. - Douglas A. Cenzer; Jeffrey B. Remmel; Amy Vanderbilt (AI&M, 2000)

On the Foundations of Answer Set Programming. - Victor W. Marek; Jeffrey B. Remmel (Answer Set Programming, 2001)

Rook Theory for Perfect Matchings. - James Haglund; Jeffrey B. Remmel (Adv. Appl. Math., 2001)

On logic programs with cardinality constraints. - Victor W. Marek; Jeffrey B. Remmel (NMR, 2002)

Spanning Trees and Function Classes. - Jeffrey B. Remmel; S. G. Williamson (Electron. J. Comb., 2002)

Effectively closed sets and graphs of computable real functions. - Douglas A. Cenzer; Jeffrey B. Remmel (Theor. Comput. Sci., 2002)

Universal Languages and the Power of Diagonalization. - Alan Nash; Russell Impagliazzo; Jeffrey B. Remmel (CCC, 2003)

A p, q-analogue of a Formula of Frobenius. - Karen S. Briggs; Jeffrey B. Remmel (Electron. J. Comb., 2003)

Index sets for omega-languages. - Douglas A. Cenzer; Jeffrey B. Remmel (Math. Log. Q., 2003)

On the expressibility of stable logic programming. - V. Wiktor Marek; Jeffrey B. Remmel (Theory Pract. Log. Program., 2003)

Using Logic Programs to Reason about Infinite Sets. - Douglas Cenzer; V. Wiktor Marek; Jeffrey B. Remmel (AI&M, 2004)

Set Constraints in Logic Programming. - V. Wiktor Marek; Jeffrey B. Remmel (LPNMR, 2004)

Answer set programming with default logic. - Victor W. Marek; Jeffrey B. Remmel (NMR, 2004)

Finding stable models via quantum computation. - David A. Meyer 001; James Pommersheim; Jeffrey B. Remmel (NMR, 2004)

Locally Determined Logic Programs and Recursive Stable Models. - Douglas A. Cenzer; Jeffrey B. Remmel; Amy Vanderbilt (Ann. Math. Artif. Intell., 2004)

The Plethysm sλ[sμ] at Hook and Near-Hook Shapes. - Thomas M. Langley; Jeffrey B. Remmel (Electron. J. Comb., 2004)

Conjectured Combinatorial Models for the Hilbert Series of Generalized Diagonal Harmonics Modules. - Nicholas A. Loehr; Jeffrey B. Remmel (Electron. J. Comb., 2004)

A lambda-ring Frobenius Characteristic for G wreath Sn. - Anthony Mendes; Jeffrey B. Remmel; Jennifer Wagner (Electron. J. Comb., 2004)

Rook Theory, Generalized Stirling Numbers and (p, q)-Analogues. - Jeffrey B. Remmel; Michelle L. Wachs (Electron. J. Comb., 2004)

Cycles and perfect matchings. - James Haglund; Jeffrey B. Remmel (Discret. Math., 2004)

A Class Of Graphs Which Has Efficient Ranking And Unranking Algorithms For Spanning Trees And Forests. - Ömer Egecioglu; Jeffrey B. Remmel; S. G. Williamson (Int. J. Found. Comput. Sci., 2004)

Index sets for computable differential equations. - Douglas Cenzer; Jeffrey B. Remmel (Math. Log. Q., 2004)

The Complexity of Inductive Definability. - Douglas A. Cenzer; Jeffrey B. Remmel (CiE, 2005)

Normal Form Theorem for Logic Programs with Cardinality Constraints. - Victor W. Marek; Jeffrey B. Remmel (Nonmonotonic Reasoning, Answer Set Programming and Constraints, 2005)

Set Based Logic Programming. - Jeffrey B. Remmel; Victor W. Marek (Nonmonotonic Reasoning, Answer Set Programming and Constraints, 2005)

PTIME Queries Revisited. - Alan Nash; Jeffrey B. Remmel; Victor Vianu (ICDT, 2005)

Logic programming with infinite sets. - Douglas A. Cenzer; Jeffrey B. Remmel; Victor W. Marek (Ann. Math. Artif. Intell., 2005)

Statistics on wreath products, perfect matchings, and signed words. - James Haglund; Nicholas A. Loehr; Jeffrey B. Remmel (Eur. J. Comb., 2005)

Enumeration of m-tuples of permutations and a new class of power bases for the space of symmetric functions. - Thomas M. Langley; Jeffrey B. Remmel (Adv. Appl. Math., 2006)

Permutations and words counted by consecutive patterns. - Anthony Mendes; Jeffrey B. Remmel (Adv. Appl. Math., 2006)

Classifying Descents According to Equivalence mod k. - Sergey Kitaev; Jeffrey B. Remmel (Electron. J. Comb., 2006)

Lyndon Words and Transition Matrices between Elementary, Homogeneous and Monomial Symmetric Functions. - Andrius Kulikauskas; Jeffrey B. Remmel (Electron. J. Comb., 2006)

Infinitely-Often Universal Languages and Diagonalization. - Alan Nash; Russell Impagliazzo; Jeffrey B. Remmel (Electron. Colloquium Comput. Complex., 2006)

Random Continuous Functions. - Paul Brodhead 001; Douglas Cenzer; Jeffrey B. Remmel (CCA, 2006)

m-Rook numbers and a generalization of a formula of Frobenius to Cm Sn. - Karen S. Briggs; Jeffrey B. Remmel (J. Comb. Theory A, 2006)

Complexity, decidability and completeness. - Douglas A. Cenzer; Jeffrey B. Remmel (J. Symb. Log., 2006)

On the complexity of inductive definitions. - Douglas A. Cenzer; Jeffrey B. Remmel (Math. Struct. Comput. Sci., 2006)

K -Trivial Closed Sets and Continuous Functions. - George Barmpalias; Douglas A. Cenzer; Jeffrey B. Remmel; Rebecca Weber (CiE, 2007)

Compactness Properties for Stable Semantics of Logic Programs. - Victor W. Marek; Jeffrey B. Remmel (Fundam. Informaticae, 2007)

On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP. - Victor W. Marek; Jeffrey B. Remmel (ICLP, 2008)

A Connection between Cantor-Bendixson Derivatives and the Well-Founded Semantics of Logic Programs. - Douglas Cenzer; Jeffrey B. Remmel (ISAIM, 2008)

A Mathematician Looks at Answer Set Programming. - Jeffrey B. Remmel (ISAIM, 2008)

The chase revisited. - Alin Deutsch; Alan Nash; Jeffrey B. Remmel (PODS, 2008)

Set based logic programming. - Howard A. Blair; Victor W. Marek; Jeffrey B. Remmel (Ann. Math. Artif. Intell., 2008)

Consistency properties and set based logic programming. - Anil Nerode; Jeffrey B. Remmel (Ann. Math. Artif. Intell., 2008)

My work with Victor Marek: a mathematician looks at answer set programming. - Jeffrey B. Remmel (Ann. Math. Artif. Intell., 2008)

Algorithmic randomness of continuous functions. - George Barmpalias; Paul Brodhead 001; Douglas A. Cenzer; Jeffrey B. Remmel; Rebecca Weber (Arch. Math. Log., 2008)

The Combinatorics of the Garsia-Haiman Modules for Hook Shapes. - Ron M. Adin; Jeffrey B. Remmel; Yuval Roichman (Electron. J. Comb., 2008)

Augmented Rook Boards and General Product Formulas. - Brian K. Miceli; Jeffrey B. Remmel (Electron. J. Comb., 2008)

Descents, inversions, and major indices in permutation groups. - Anthony Mendes; Jeffrey B. Remmel (Discret. Math., 2008)

Counting Descents, Rises, and Levels, with Prescribed First Element, in Words. - Sergey Kitaev; Toufik Mansour; Jeffrey B. Remmel (Discret. Math. Theor. Comput. Sci., 2008)

Counting descent pairs with prescribed tops and bottoms. - John T. Hall; Jeffrey B. Remmel (J. Comb. Theory A, 2008)

S01 and P01 Equivalence Structures. - Douglas A. Cenzer; Valentina S. Harizanov; Jeffrey B. Remmel (CiE, 2009)

Automata and Answer Set Programming. - Victor W. Marek; Jeffrey B. Remmel (LFCS, 2009)

Rook-by-rook rook theory: Bijective proofs of rook and hit equivalences. - Nicholas A. Loehr; Jeffrey B. Remmel (Adv. Appl. Math., 2009)

Space complexity of Abelian groups. - Douglas Cenzer; Rodney G. Downey; Jeffrey B. Remmel; Zia Uddin (Arch. Math. Log., 2009)

The complexity of recursive constraint satisfaction problems. - Victor W. Marek; Jeffrey B. Remmel (Ann. Pure Appl. Log., 2009)

q-Counting Descent Pairs with Prescribed Tops and Bottoms. - John T. Hall; Jeffrey Liese; Jeffrey B. Remmel (Electron. J. Comb., 2009)

Rationality, Irrationality, and Wilf Equivalence in Generalized Factor Order. - Sergey Kitaev; Jeffrey Liese; Jeffrey B. Remmel; Bruce E. Sagan (Electron. J. Comb., 2009)

An Application of Proof-Theory in answer Set Programming - Victor W. Marek; Jeffrey B. Remmel (CoRR, 2009)

Equivalence structures and isomorphisms in the difference hierarchy. - Douglas Cenzer; Geoffrey LaForte; Jeffrey B. Remmel (J. Symb. Log., 2009)

K-Triviality of Closed Sets and Continuous Functions. - George Barmpalias; Douglas A. Cenzer; Jeffrey B. Remmel; Rebecca Weber (J. Log. Comput., 2009)

Generating Functions for Permutations which Contain a Given Descent Set. - Jeffrey B. Remmel; Manda Riehl (Electron. J. Comb., 2010)

Place-Difference-Value Patterns: A Generalization of Generalized Permutation and Word Patterns. - Sergey Kitaev; Jeffrey B. Remmel (Integers, 2010)

Effectively Reasoning about Infinite Sets in Answer Set Programming. - Victor W. Marek; Jeffrey B. Remmel (Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning, 2011)

Effective Categoricity of Injection Structures. - Douglas Cenzer; Valentina S. Harizanov; Jeffrey B. Remmel (CiE, 2011)

Hybrid ASP. - Alex Brik; Jeffrey B. Remmel (ICLP (Technical Communications), 2011)

Σ01 and Π01 equivalence structures. - Douglas Cenzer; Valentina S. Harizanov; Jeffrey B. Remmel (Ann. Pure Appl. Log., 2011)

Minimal Overlapping Patterns in Colored Permutations. - Adrian Duane; Jeffrey B. Remmel (Electron. J. Comb., 2011)

Enumerating (2+2)-free posets by the number of minimal elements and other statistics. - Sergey Kitaev; Jeffrey B. Remmel (Discret. Appl. Math., 2011)

Quasi-symmetric functions and up-down compositions. - Evan Fuller; Jeffrey B. Remmel (Discret. Math., 2011)

Guarded resolution for Answer Set Programming. - Victor W. Marek; Jeffrey B. Remmel (Theory Pract. Log. Program., 2011)

Disjunctive Programs with Set Constraints. - Victor W. Marek; Jeffrey B. Remmel (Correct Reasoning, 2012)

Combining Logic, Continuous Parameters and Markov Decision Processes Using Hybrid ASP. - Alex Brik; Jeffrey B. Remmel (StarAI@UAI, 2012)

A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs. - Douglas Cenzer; Jeffrey B. Remmel (Ann. Math. Artif. Intell., 2012)

Expressing Preferences using Preference Set Constraint Atoms - Alex Brik; Jeffrey B. Remmel (CoRR, 2012)

Forward Chaining for Hybrid ASP. - Alex Brik; Jeffrey B. Remmel (LFCS, 2013)

Sub-computable Bounded Pseudorandomness. - Douglas Cenzer; Jeffrey B. Remmel (LFCS, 2013)

Index sets for Finite Normal Predicate Logic Programs - Douglas Cenzer; Victor W. Marek; Jeffrey B. Remmel (CoRR, 2013)

A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of a permutation pattern. - Miles Eli Jones; Jeffrey B. Remmel (Discret. Math., 2013)

Two-to-one structures. - Douglas Cenzer; Valentina S. Harizanov; Jeffrey B. Remmel (J. Log. Comput., 2013)

Hybrid Answer Set Programming. - Alex Brik; Jeffrey B. Remmel (Ann. Pure Appl. Log., 2014)

Consecutive Up-down Patterns in Up-down Permutations. - Jeffrey B. Remmel (Electron. J. Comb., 2014)

Sub-computable Boundedness Randomness. - Sam Buss; Douglas Cenzer; Jeffrey B. Remmel (Log. Methods Comput. Sci., 2014)

m-Level rook placements. - Kenneth Barrese; Nicholas A. Loehr; Jeffrey B. Remmel; Bruce E. Sagan (J. Comb. Theory A, 2014)

The 1-Box Pattern on Pattern-Avoiding Permutations. - Sergey Kitaev; Jeffrey B. Remmel (J. Integer Seq., 2014)

Diagnosing Automatic Whitelisting for Dynamic Remarketing Ads Using Hybrid ASP. - Alex Brik; Jeffrey B. Remmel (LPNMR, 2015)

Representing Graphs via Pattern Avoiding Words. - Miles Eli Jones; Sergey Kitaev; Artem V. Pyatkin; Jeffrey B. Remmel (Electron. J. Comb., 2015)

(a, b)-rectangle patterns in permutations and words. - Sergey Kitaev; Jeffrey B. Remmel (Discret. Appl. Math., 2015)

Frame patterns in n-cycles. - Miles Eli Jones; Sergey Kitaev; Jeffrey B. Remmel (Discret. Math., 2015)

Quadrant Marked Mesh Patterns in 132-Avoiding Permutations II. - Sergey Kitaev; Jeffrey B. Remmel; Mark Tiefenbruck (Integers, 2015)

Quadrant Marked Mesh Patterns in 132-avoiding Permutations III. - Sergey Kitaev; Jeffrey B. Remmel; Mark Tiefenbruck (Integers, 2015)

An extension of MacMahon's equidistribution theorem to ordered set partitions. - Jeffrey B. Remmel; Andrew Timothy Wilson (J. Comb. Theory A, 2015)

Index Sets for Finite Normal Predicate Logic Programs with Function Symbols. - Douglas A. Cenzer; Victor W. Marek; Jeffrey B. Remmel (LFCS, 2016)

Generating functions for descents over permutations which avoid sets of consecutive patterns. - Quang T. Bach; Jeffrey B. Remmel (Australas. J Comb., 2016)

Q-analogues of convolutions of Fibonacci numbers. - Jeffrey B. Remmel; Janine LoBue Tiefenbruck (Australas. J Comb., 2016)

Descent c-Wilf Equivalence. - Quang T. Bach; Jeffrey B. Remmel (Discret. Math. Theor. Comput. Sci., 2016)

Asymptotics for minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shape, and column strict arrays. - Ran Pan; Jeffrey B. Remmel (Discret. Math. Theor. Comput. Sci., 2016)

Bijections on m-level rook placements. - Kenneth Barrese; Nicholas A. Loehr; Jeffrey B. Remmel; Bruce E. Sagan (Eur. J. Comb., 2016)

A Binomial Distribution Model for the Traveling Salesman Problem Based on Frequency Quadrilaterals. - Yong Wang 027; Jeffrey B. Remmel (J. Graph Algorithms Appl., 2016)

Injection Structures Specified by Finite State Transducers. - Sam Buss; Douglas Cenzer; Mia Minnes; Jeffrey B. Remmel (Computability and Complexity, 2017)

Action Language Hybrid AL. - Alex Brik; Jeffrey B. Remmel (LPNMR, 2017)

Rises in forests of binary shrubs. - Jeffrey B. Remmel; Sai-Nan Zheng (Discret. Math. Theor. Comput. Sci., 2017)

A Method to Compute the Sparse Graphs for Traveling Salesman Problem Based on Frequency Quadrilaterals. - Yong Wang 027; Jeffrey B. Remmel (FAW, 2018)

An iterative algorithm to eliminate edges for traveling salesman problem based on a new binomial distribution - Eliminating edges for TSP. - Yong Wang 027; Jeffrey B. Remmel (Appl. Intell., 2018)

On the Schur Positivity of Δe2 en[X]. - Dun Qiu; Jeffrey B. Remmel; Emily Sergel; Guoce Xin (Electron. J. Comb., 2018)

Counting consecutive pattern matches in Sn(132) and Sn(123). - Ran Pan; Dun Qiu; Jeffrey B. Remmel (Adv. Appl. Math., 2019)

The combinatorial properties of the Benoumhani polynomials for the Whitney numbers of Dowling lattices. - Jeffrey B. Remmel; Sittipong Thamrongpairoj (Discret. Math., 2019)

Classical pattern distributions in Sn(132) and Sn(123). - Dun Qiu; Jeffrey B. Remmel (Discret. Math. Theor. Comput. Sci., 2019)

Schur function expansions and the Rational Shuffle Theorem. - Dun Qiu; Jeffrey B. Remmel (J. Comb. Theory A, 2020)

On the complexity of index sets for finite predicate logic programs which allow function symbols. - Douglas Cenzer; Victor W. Marek; Jeffrey B. Remmel (J. Log. Comput., 2020)

Effective Categoricity of Automatic Equivalence and Nested Equivalence Structures. - Jacob Carson; Douglas Cenzer; Jeffrey B. Remmel (Theory Comput. Syst., 2020)

Positional Marked Patterns in Permutations. - Sittipong Thamrongpairoj; Jeffrey B. Remmel (Discret. Math. Theor. Comput. Sci., 2022)