Jeffrey B. Remmel

According to our database1, Jeffrey B. Remmel authored at least 189 papers between 1976 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Counting consecutive pattern matches in Sn(132) and Sn(123).
Adv. Appl. Math., 2019

2018
On the Schur Positivity of Δe2 en[X].
Electr. J. Comb., 2018

An iterative algorithm to eliminate edges for traveling salesman problem based on a new binomial distribution - Eliminating edges for TSP.
Appl. Intell., 2018

A Method to Compute the Sparse Graphs for Traveling Salesman Problem Based on Frequency Quadrilaterals.
Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

2017
Rises in forests of binary shrubs.
Discrete Mathematics & Theoretical Computer Science, 2017

Action Language Hybrid AL.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2017

Injection Structures Specified by Finite State Transducers.
Proceedings of the Computability and Complexity, 2017

2016
A Binomial Distribution Model for the Traveling Salesman Problem Based on Frequency Quadrilaterals.
J. Graph Algorithms Appl., 2016

Bijections on m-level rook placements.
Eur. J. Comb., 2016

Asymptotics for minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shape, and column strict arrays.
Discrete Mathematics & Theoretical Computer Science, 2016

Descent c-Wilf Equivalence.
Discrete Mathematics & Theoretical Computer Science, 2016

Q-analogues of convolutions of Fibonacci numbers.
Australasian J. Combinatorics, 2016

Generating functions for descents over permutations which avoid sets of consecutive patterns.
Australasian J. Combinatorics, 2016

Index Sets for Finite Normal Predicate Logic Programs with Function Symbols.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2016

2015
An extension of MacMahon's equidistribution theorem to ordered set partitions.
J. Comb. Theory, Ser. A, 2015

Frame patterns in n-cycles.
Discrete Mathematics, 2015

(a, b)-rectangle patterns in permutations and words.
Discrete Applied Mathematics, 2015

Representing Graphs via Pattern Avoiding Words.
Electr. J. Comb., 2015

Diagnosing Automatic Whitelisting for Dynamic Remarketing Ads Using Hybrid ASP.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2015

2014
m-Level rook placements.
J. Comb. Theory, Ser. A, 2014

Sub-computable Boundedness Randomness.
Logical Methods in Computer Science, 2014

Consecutive Up-down Patterns in Up-down Permutations.
Electr. J. Comb., 2014

Hybrid Answer Set Programming.
Ann. Pure Appl. Logic, 2014

2013
Two-to-one structures.
J. Log. Comput., 2013

A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of a permutation pattern.
Discrete Mathematics, 2013

Sub-computable Bounded Pseudorandomness.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2013

Forward Chaining for Hybrid ASP.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2013

2012
A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs.
Ann. Math. Artif. Intell., 2012

Disjunctive Programs with Set Constraints.
Proceedings of the Correct Reasoning, 2012

2011
Guarded resolution for Answer Set Programming.
TPLP, 2011

Quasi-symmetric functions and up-down compositions.
Discrete Mathematics, 2011

Enumerating (2+2)-free posets by the number of minimal elements and other statistics.
Discrete Applied Mathematics, 2011

Minimal Overlapping Patterns in Colored Permutations.
Electr. J. Comb., 2011

Σ01 and Π01 equivalence structures.
Ann. Pure Appl. Logic, 2011

Hybrid ASP.
Proceedings of the Technical Communications of the 27th International Conference on Logic Programming, 2011

Effective Categoricity of Injection Structures.
Proceedings of the Models of Computation in Context, 2011

Effectively Reasoning about Infinite Sets in Answer Set Programming.
Proceedings of the Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning, 2011

2010
Generating Functions for Permutations which Contain a Given Descent Set.
Electr. J. Comb., 2010

2009
K-Triviality of Closed Sets and Continuous Functions.
J. Log. Comput., 2009

Equivalence structures and isomorphisms in the difference hierarchy.
J. Symb. Log., 2009

Rationality, Irrationality, and Wilf Equivalence in Generalized Factor Order.
Electr. J. Comb., 2009

q-Counting Descent Pairs with Prescribed Tops and Bottoms.
Electr. J. Comb., 2009

The complexity of recursive constraint satisfaction problems.
Ann. Pure Appl. Logic, 2009

Space complexity of Abelian groups.
Arch. Math. Log., 2009

Rook-by-rook rook theory: Bijective proofs of rook and hit equivalences.
Adv. Appl. Math., 2009

Automata and Answer Set Programming.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2009

S01 and P01 Equivalence Structures.
Proceedings of the Mathematical Theory and Computational Practice, 2009

2008
Counting descent pairs with prescribed tops and bottoms.
J. Comb. Theory, Ser. A, 2008

Counting Descents, Rises, and Levels, with Prescribed First Element, in Words.
Discrete Mathematics & Theoretical Computer Science, 2008

Descents, inversions, and major indices in permutation groups.
Discrete Mathematics, 2008

Augmented Rook Boards and General Product Formulas.
Electr. J. Comb., 2008

The Combinatorics of the Garsia-Haiman Modules for Hook Shapes.
Electr. J. Comb., 2008

Algorithmic randomness of continuous functions.
Arch. Math. Log., 2008

My work with Victor Marek: a mathematician looks at answer set programming.
Ann. Math. Artif. Intell., 2008

Consistency properties and set based logic programming.
Ann. Math. Artif. Intell., 2008

Set based logic programming.
Ann. Math. Artif. Intell., 2008

The chase revisited.
Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2008

A Mathematician Looks at Answer Set Programming.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

A Connection between Cantor-Bendixson Derivatives and the Well-Founded Semantics of Logic Programs.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP.
Proceedings of the Logic Programming, 24th International Conference, 2008

2007
Random Continuous Functions.
Electr. Notes Theor. Comput. Sci., 2007

Compactness Properties for Stable Semantics of Logic Programs.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2007

K -Trivial Closed Sets and Continuous Functions.
Proceedings of the Computation and Logic in the Real World, 2007

2006
On the complexity of inductive definitions.
Mathematical Structures in Computer Science, 2006

Complexity, decidability and completeness.
J. Symb. Log., 2006

m-Rook numbers and a generalization of a formula of Frobenius to Cm Sn.
J. Comb. Theory, Ser. A, 2006

Infinitely-Often Universal Languages and Diagonalization.
Electronic Colloquium on Computational Complexity (ECCC), 2006

Lyndon Words and Transition Matrices between Elementary, Homogeneous and Monomial Symmetric Functions.
Electr. J. Comb., 2006

Classifying Descents According to Equivalence mod k.
Electr. J. Comb., 2006

Permutations and words counted by consecutive patterns.
Adv. Appl. Math., 2006

Enumeration of m-tuples of permutations and a new class of power bases for the space of symmetric functions.
Adv. Appl. Math., 2006

2005
Statistics on wreath products, perfect matchings, and signed words.
Eur. J. Comb., 2005

Logic programming with infinite sets.
Ann. Math. Artif. Intell., 2005

PTIME Queries Revisited.
Proceedings of the Database Theory, 2005

Set Based Logic Programming.
Proceedings of the Nonmonotonic Reasoning, 2005

Normal Form Theorem for Logic Programs with Cardinality Constraints.
Proceedings of the Nonmonotonic Reasoning, 2005

The Complexity of Inductive Definability.
Proceedings of the New Computational Paradigms, 2005

2004
Index sets for computable differential equations.
Math. Log. Q., 2004

A Class Of Graphs Which Has Efficient Ranking And Unranking Algorithms For Spanning Trees And Forests.
Int. J. Found. Comput. Sci., 2004

Cycles and perfect matchings.
Discrete Mathematics, 2004

Rook Theory, Generalized Stirling Numbers and (p, q)-Analogues.
Electr. J. Comb., 2004

A lambda-ring Frobenius Characteristic for G wreath Sn.
Electr. J. Comb., 2004

Conjectured Combinatorial Models for the Hilbert Series of Generalized Diagonal Harmonics Modules.
Electr. J. Comb., 2004

The Plethysm sλ[sμ] at Hook and Near-Hook Shapes.
Electr. J. Comb., 2004

Locally Determined Logic Programs and Recursive Stable Models.
Ann. Math. Artif. Intell., 2004

Finding stable models via quantum computation.
Proceedings of the 10th International Workshop on Non-Monotonic Reasoning (NMR 2004), 2004

Answer set programming with default logic.
Proceedings of the 10th International Workshop on Non-Monotonic Reasoning (NMR 2004), 2004

Set Constraints in Logic Programming.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2004

Using Logic Programs to Reason about Infinite Sets.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2004

2003
Index sets for omega-languages.
Math. Log. Q., 2003

A p, q-analogue of a Formula of Frobenius.
Electr. J. Comb., 2003

Universal Languages and the Power of Diagonalization.
Proceedings of the 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 2003

2002
Effectively closed sets and graphs of computable real functions.
Theor. Comput. Sci., 2002

Spanning Trees and Function Classes.
Electr. J. Comb., 2002

On logic programs with cardinality constraints.
Proceedings of the 9th International Workshop on Non-Monotonic Reasoning (NMR 2002), 2002

2001
Rook Theory for Perfect Matchings.
Adv. Appl. Math., 2001

On the Expressibility of Stable Logic Programming.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2001

On the Foundations of Answer Set Programming.
Proceedings of the Answer Set Programming, 2001

2000
Characterizing the Set of Extensions of a Nonmonotonic Rule System with Levels.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2000

1999
Index Sets in Computable Analysis.
Theor. Comput. Sci., 1999

Large-Scale Regularities of Lattice Embeddings of Posets.
Order, 1999

Logic Programs, Well-Orderings, and Forward Chaining.
Ann. Pure Appl. Logic, 1999

Locally Determined Logic Programs.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1999

1998
Complexity and Categoricity.
Inf. Comput., 1998

Hook-Schur Functions Analogues of Littlewood's Identities and their Bijective Proofs.
Eur. J. Comb., 1998

A simple proof of the Littlewood-Richardson rule and applications.
Discrete Mathematics, 1998

Formulas for the expansion of the plethysms s2[S(a, b)] and S2[S(nk)].
Discrete Mathematics, 1998

Index Sets for Pi01 Classes.
Ann. Pure Appl. Logic, 1998

Preface.
Ann. Pure Appl. Logic, 1998

Feasible Graphs with Standard Universe.
Ann. Pure Appl. Logic, 1998

1997
Annotated Nonmonotonic Rule Systems.
Theor. Comput. Sci., 1997

Complexity of Recursive Normal Default Logic.
Fundam. Inform., 1997

Quasi-Simple Relations in Copies of a Given Recursive Structure.
Ann. Pure Appl. Logic, 1997

Nonmonotonic rule systems with recursive sets of restraints.
Arch. Math. Log., 1997

Non-Monotonic Reasoning with Quantified Boolean Constraints.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1997

Basic Forward Chaining Construction for Logic Programs.
Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

Hybrid Dynamic Programming.
Proceedings of the Hybrid and Real-Time Systems, 1997

Scalble Data and Sensor Fusion via Multiple Agent Hybrid Systems.
Proceedings of the Hybrid Systems V, 1997

1996
Combinatorics of theq-Basis of Symmetric Functions.
J. Comb. Theory, Ser. A, 1996

The combinatorics of transition matrices between the bases of the symmetric functions and the Bn analogues.
Discrete Mathematics, 1996

McNaughton Games and Extracting Strategies for Concurrent Programs.
Ann. Pure Appl. Logic, 1996

On the Lattices of NP-Subspaces of a Polynomial Time Vector Space over a Finite Field.
Ann. Pure Appl. Logic, 1996

Nonmonotonic Rule Systems: Foward Chaining, Constraints, and Complexity (Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

On the Complexity of Abduction.
Proceedings of the Proceedings, 1996

Hybrid System Games: Extraction of Control Automata with Small Topologies.
Proceedings of the Hybrid Systems IV, 1996

Agent Based Velocity Control of Highway Systems.
Proceedings of the Hybrid Systems IV, 1996

1995
Viability in Hybrid Systems.
Theor. Comput. Sci., 1995

Feasible Graphs and Colorings.
Math. Log. Q., 1995

A Combinatorial Proof of the Equivalence of the Classical and Combinatorial Definitions of Schur Function.
J. Comb. Theory, Ser. A, 1995

Permutation Enumeration of the Symmetric Group and the Combinatorics of Symmetric Functions.
J. Comb. Theory, Ser. A, 1995

On Logical Constraints in Logic Programming.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1995

Complexity of Normal Default Logic and Related Modes of Nonmonotonic Reasoning
Proceedings of the Proceedings, 1995

Hybrid Systems: Chattering Approximation to Relaxed Controls.
Proceedings of the Hybrid Systems III: Verification and Control, 1995

1994
Proofs, programs, and run times.
Meth. of Logic in CS, 1994

A Context for Belief Revision: Forward Chaining - Normal Nonmonotonic Rule Systems.
Ann. Pure Appl. Logic, 1994

On Speedable and Levelable Vector Spaces.
Ann. Pure Appl. Logic, 1994

On Logical Constraints in Logic Programming.
Proceedings of the ILPS 1994, 1994

Feasibly Categorial Models.
Proceedings of the Logical and Computational Complexity. Selected Papers. Logic and Computational Complexity, 1994

Controllers as Fixed Points of Set-Valued Operators.
Proceedings of the Hybrid Systems II, 1994

Hybrid Systems as Finsler Manifolds: Finite State Control as Approximation to Connections.
Proceedings of the Hybrid Systems II, 1994

1992
Formulas for the expansion of the Kronecker products S(m, n) * S(1p-r, r) and S(1k2l) * S(1p-r, r).
Discrete Mathematics, 1992

How Complicated is the Set of Stable Models of a Recursive Logic Program?
Ann. Pure Appl. Logic, 1992

Cancellation Laws for Polynomial-Time p-Isolated Sets.
Ann. Pure Appl. Logic, 1992

Polynomial-Time Abelian Groups.
Ann. Pure Appl. Logic, 1992

A Theory of Nonmonotonic Rule Systems II.
Ann. Math. Artif. Intell., 1992

Rule Systems and Well-Orderings.
Proceedings of the Informal Proceedings of the Workshop Structural Complexity and Recursion-theoretic methods in Logic-Programming, 1992

The Stable Models of a Predicate Logic Program.
Proceedings of the Logic Programming, 1992

1991
Special Rim Hook Tabloids and Some New Multiplicity-Free S-Series.
SIAM J. Discrete Math., 1991

Pi01-Classes and Rado's Selection Principle.
J. Symb. Log., 1991

Brick tabloids and the connection matrices between bases of symmetric functions.
Discrete Applied Mathematics, 1991

Polynomial-Time versus Recursive Models.
Ann. Pure Appl. Logic, 1991

1990
The monomial symmetric functions and the Frobenius map.
J. Comb. Theory, Ser. A, 1990

A Theory of Nonmonotonic Rule Systems I.
Ann. Math. Artif. Intell., 1990

A Theory of Nonmonotonic Rule Systems
Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990

1989
Complexity-Theoretic Algebra II: Boolean Algebras.
Ann. Pure Appl. Logic, 1989

Classification of Degree Classes Associated with r.e. Subspaces.
Ann. Pure Appl. Logic, 1989

Polynomially Grade Logic I: A Graded Version of System T
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

1987
Automorphisms and Recursive Structures.
Math. Log. Q., 1987

Permutation statistics and (k, l)-hook Schur functions.
Discrete Mathematics, 1987

Recursively rigid Boolean algebras.
Ann. Pure Appl. Logic, 1987

The undecidability of the lattice of R.E. closed subsets of an effective topological space.
Ann. Pure Appl. Logic, 1987

Complexity theoretic algebra I - vector spaces over finite fields.
Proceedings of the Second Annual Conference on Structure in Complexity Theory, 1987

1986
Q-counting rook configurations and a formula of frobenius.
J. Comb. Theory, Ser. A, 1986

Bijections for Cayley trees, spanning trees, and their q-analogues.
J. Comb. Theory, Ser. A, 1986

Graph colorings and recursively bounded Π10-classes.
Ann. Pure Appl. Logic, 1986

Generic objects in recursion theory II: Operations on recursive approximation spaces.
Ann. Pure Appl. Logic, 1986

1985
Shuffles of permutations and the Kronecker product.
Graphs and Combinatorics, 1985

A Combinatorial View of Andrews' Proof of the L-M-W Conjectures.
Eur. J. Comb., 1985

1984
Effectively Nowhere Simple Sets.
J. Symb. Log., 1984

The Universal Splitting Property. II.
J. Symb. Log., 1984

The Universal Complementation Property.
J. Symb. Log., 1984

Multiplying Schur functions.
J. Algorithms, 1984

1983
Indiscernibles and Decidable Models.
J. Symb. Log., 1983

Degrees of Recursively Enumerable Topological Spaces.
J. Symb. Log., 1983

A Bijective Proof of the Hook Formula for the Number of Column Strict Tableaux with Bounded Entries.
Eur. J. Comb., 1983

A Note on a Recursion for the Number of Derangements.
Eur. J. Comb., 1983

1982
Bijective Proofs of Some Classical Partition Identities.
J. Comb. Theory, Ser. A, 1982

1981
Recursive Boolean Algebras with Recursive Atoms.
J. Symb. Log., 1981

Recursive Isomorphism Types of Recursive Boolean Algebras.
J. Symb. Log., 1981

Partial Orderings of Fixed Finite Dimension: Model Companions and Density.
J. Symb. Log., 1981

1980
CO-Simple Higher-Order Indecomposable Isols.
Math. Log. Q., 1980

Recursion Theory on Orderings. II.
J. Symb. Log., 1980

On R.E. and CO-R.E. Vector Spaces with Nonextendible Bases.
J. Symb. Log., 1980

A Combinatorial Interpretation of q-Derangement and q-Laguerre Numbers.
Eur. J. Comb., 1980

1979
R-Maximal Boolean Algebras.
J. Symb. Log., 1979

Recursion Theory on Orderings. I. A Model Theoretic Setting.
J. Symb. Log., 1979

1978
A r-Maximal Vector Space not contained in any Maximal Vector Space.
J. Symb. Log., 1978

1977
Maximal and Cohesive Vector Spaces.
J. Symb. Log., 1977

1976
Co-Hypersimple Structures.
J. Symb. Log., 1976


  Loading...