Jeffrey B. Remmel

207 papers A* 5A 2B 9C 4Misc 9Journal 152Unranked 25
YearRankTypeTitle / Venue / Authors
2022 J jnl
Positional Marked Patterns in Permutations.
Discret. Math. Theor. Comput. Sci.
Sittipong Thamrongpairoj, Jeffrey B. Remmel
2020 J jnl
Effective Categoricity of Automatic Equivalence and Nested Equivalence Structures.
Theory Comput. Syst.
Jacob Carson, Douglas Cenzer, Jeffrey B. Remmel
2020 J jnl
On the complexity of index sets for finite predicate logic programs which allow function symbols.
J. Log. Comput.
Douglas Cenzer, Victor W. Marek, Jeffrey B. Remmel
2020 J jnl
Schur function expansions and the Rational Shuffle Theorem.
J. Comb. Theory A
Dun Qiu, Jeffrey B. Remmel
2019 J jnl
Classical pattern distributions in S
Discret. Math. Theor. Comput. Sci.
Dun Qiu, Jeffrey B. Remmel
2019 J jnl
Counting consecutive pattern matches in Sn(132) and Sn(123).
Adv. Appl. Math.
Ran Pan, Dun Qiu, Jeffrey B. Remmel
2019 J jnl
The combinatorial properties of the Benoumhani polynomials for the Whitney numbers of Dowling lattices.
Discret. Math.
Jeffrey B. Remmel, Sittipong Thamrongpairoj
2018 Misc conf
A Method to Compute the Sparse Graphs for Traveling Salesman Problem Based on Frequency Quadrilaterals.
FAW
Yong Wang, Jeffrey B. Remmel
2018 J jnl
A Method to Compute the Sparse Graphs for Traveling Salesman Problem Based on Frequency Quadrilaterals.
CoRR
Yong Wang, Jeffrey B. Remmel
2018 J jnl
An iterative algorithm to eliminate edges for traveling salesman problem based on a new binomial distribution - Eliminating edges for TSP.
Appl. Intell.
Yong Wang, Jeffrey B. Remmel
2018 J jnl
On the Schur Positivity of Δ
Electron. J. Comb.
Dun Qiu, Jeffrey B. Remmel, Emily Sergel, Guoce Xin
2017 B conf
Action Language Hybrid AL.
LPNMR
Alex Brik, Jeffrey B. Remmel
2017 — conf
Injection Structures Specified by Finite State Transducers.
Computability and Complexity
Sam Buss, Douglas Cenzer, Mia Minnes, Jeffrey B. Remmel
2017 J jnl
Rises in forests of binary shrubs.
Discret. Math. Theor. Comput. Sci.
Jeffrey B. Remmel, Sai-Nan Zheng
2016 J jnl
A Binomial Distribution Model for the Traveling Salesman Problem Based on Frequency Quadrilaterals.
J. Graph Algorithms Appl.
Yong Wang, Jeffrey B. Remmel
2016 J jnl
Asymptotics for minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shape, and column strict arrays.
Discret. Math. Theor. Comput. Sci.
Ran Pan, Jeffrey B. Remmel
2016 J jnl
Bijections on m-level rook placements.
Eur. J. Comb.
Kenneth Barrese, Nicholas A. Loehr, Jeffrey B. Remmel, Bruce E. Sagan
2016 J jnl
Descent c-Wilf Equivalence.
Discret. Math. Theor. Comput. Sci.
Quang T. Bach, Jeffrey B. Remmel
2016 J jnl
Generating functions for descents over permutations which avoid sets of consecutive patterns.
Australas. J Comb.
Quang T. Bach, Jeffrey B. Remmel
2016 Misc conf
Index Sets for Finite Normal Predicate Logic Programs with Function Symbols.
LFCS
Douglas A. Cenzer, Victor W. Marek, Jeffrey B. Remmel
2016 J jnl
Q-analogues of convolutions of Fibonacci numbers.
Australas. J Comb.
Jeffrey B. Remmel, Janine LoBue Tiefenbruck
2015 J jnl
(a, b)-rectangle patterns in permutations and words.
Discret. Appl. Math.
Sergey Kitaev, Jeffrey B. Remmel
2015 J jnl
An extension of MacMahon's equidistribution theorem to ordered set partitions.
J. Comb. Theory A
Jeffrey B. Remmel, Andrew Timothy Wilson
2015 B conf
Diagnosing Automatic Whitelisting for Dynamic Remarketing Ads Using Hybrid ASP.
LPNMR
Alex Brik, Jeffrey B. Remmel
2015 J jnl
Frame patterns in n-cycles.
Discret. Math.
Miles Eli Jones, Sergey Kitaev, Jeffrey B. Remmel
2015 J jnl
Quadrant Marked Mesh Patterns in 132-Avoiding Permutations II.
Integers
Sergey Kitaev, Jeffrey B. Remmel, Mark Tiefenbruck
2015 J jnl
Quadrant Marked Mesh Patterns in 132-avoiding Permutations III.
Integers
Sergey Kitaev, Jeffrey B. Remmel, Mark Tiefenbruck
2015 J jnl
Representing Graphs via Pattern Avoiding Words.
Electron. J. Comb.
Miles Eli Jones, Sergey Kitaev, Artem V. Pyatkin, Jeffrey B. Remmel
2014 J jnl
Consecutive Up-down Patterns in Up-down Permutations.
Electron. J. Comb.
Jeffrey B. Remmel
2014 J jnl
Hybrid Answer Set Programming.
Ann. Pure Appl. Log.
Alex Brik, Jeffrey B. Remmel
2014 J jnl
Sub-computable Boundedness Randomness.
Log. Methods Comput. Sci.
Sam Buss, Douglas Cenzer, Jeffrey B. Remmel
2014 J jnl
The 1-Box Pattern on Pattern-Avoiding Permutations.
J. Integer Seq.
Sergey Kitaev, Jeffrey B. Remmel
2014 J jnl
m-Level rook placements.
J. Comb. Theory A
Kenneth Barrese, Nicholas A. Loehr, Jeffrey B. Remmel, Bruce E. Sagan
2013 J jnl
A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of a permutation pattern.
Discret. Math.
Miles Eli Jones, Jeffrey B. Remmel
2013 Misc conf
Forward Chaining for Hybrid ASP.
LFCS
Alex Brik, Jeffrey B. Remmel
2013 J jnl
Index sets for Finite Normal Predicate Logic Programs
CoRR
Douglas Cenzer, Victor W. Marek, Jeffrey B. Remmel
2013 Misc conf
Sub-computable Bounded Pseudorandomness.
LFCS
Douglas Cenzer, Jeffrey B. Remmel
2013 J jnl
Two-to-one structures.
J. Log. Comput.
Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel
2012 J jnl
A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs.
Ann. Math. Artif. Intell.
Douglas Cenzer, Jeffrey B. Remmel
2012 — conf
Combining Logic, Continuous Parameters and Markov Decision Processes Using Hybrid ASP.
StarAI@UAI
Alex Brik, Jeffrey B. Remmel
2012 — conf
Disjunctive Programs with Set Constraints.
Correct Reasoning
Victor W. Marek, Jeffrey B. Remmel
2012 J jnl
Expressing Preferences using Preference Set Constraint Atoms
CoRR
Alex Brik, Jeffrey B. Remmel
2011 C conf
Effective Categoricity of Injection Structures.
CiE
Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel
2011 — conf
Effectively Reasoning about Infinite Sets in Answer Set Programming.
Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning
Victor W. Marek, Jeffrey B. Remmel
2011 J jnl
Enumerating (2+2)-free posets by the number of minimal elements and other statistics.
Discret. Appl. Math.
Sergey Kitaev, Jeffrey B. Remmel
2011 J jnl
Guarded resolution for Answer Set Programming.
Theory Pract. Log. Program.
Victor W. Marek, Jeffrey B. Remmel
2011 — conf
Hybrid ASP.
ICLP (Technical Communications)
Alex Brik, Jeffrey B. Remmel
2011 J jnl
Minimal Overlapping Patterns in Colored Permutations.
Electron. J. Comb.
Adrian Duane, Jeffrey B. Remmel
2011 J jnl
Quasi-symmetric functions and up-down compositions.
Discret. Math.
Evan Fuller, Jeffrey B. Remmel
2011 J jnl
Σ
Ann. Pure Appl. Log.
Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel
2010 J jnl
Generating Functions for Permutations which Contain a Given Descent Set.
Electron. J. Comb.
Jeffrey B. Remmel, Manda Riehl
2010 J jnl
Place-Difference-Value Patterns: A Generalization of Generalized Permutation and Word Patterns.
Integers
Sergey Kitaev, Jeffrey B. Remmel
2009 J jnl
An Application of Proof-Theory in answer Set Programming
CoRR
Victor W. Marek, Jeffrey B. Remmel
2009 Misc conf
Automata and Answer Set Programming.
LFCS
Victor W. Marek, Jeffrey B. Remmel
2009 J jnl
Equivalence structures and isomorphisms in the difference hierarchy.
J. Symb. Log.
Douglas Cenzer, Geoffrey LaForte, Jeffrey B. Remmel
2009 J jnl
Guarded resolution for answer set programming
CoRR
V. Wiktor Marek, Jeffrey B. Remmel
2009 J jnl
Rationality, Irrationality, and Wilf Equivalence in Generalized Factor Order.
Electron. J. Comb.
Sergey Kitaev, Jeffrey Liese, Jeffrey B. Remmel, Bruce E. Sagan
2009 J jnl
Rook-by-rook rook theory: Bijective proofs of rook and hit equivalences.
Adv. Appl. Math.
Nicholas A. Loehr, Jeffrey B. Remmel
2009 C conf
S
CiE
Douglas A. Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel
2009 J jnl
Space complexity of Abelian groups.
Arch. Math. Log.
Douglas Cenzer, Rodney G. Downey, Jeffrey B. Remmel, Zia Uddin
2009 J jnl
The complexity of recursive constraint satisfaction problems.
Ann. Pure Appl. Log.
Victor W. Marek, Jeffrey B. Remmel
2009 J jnl
q-Counting Descent Pairs with Prescribed Tops and Bottoms.
Electron. J. Comb.
John T. Hall, Jeffrey Liese, Jeffrey B. Remmel
2008 Misc conf
A Connection between Cantor-Bendixson Derivatives and the Well-Founded Semantics of Logic Programs.
ISAIM
Douglas Cenzer, Jeffrey B. Remmel
2008 Misc conf
A Mathematician Looks at Answer Set Programming.
ISAIM
Jeffrey B. Remmel
2008 J jnl
Algorithmic randomness of continuous functions.
Arch. Math. Log.
George Barmpalias, Paul Brodhead, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber
2008 J jnl
Augmented Rook Boards and General Product Formulas.
Electron. J. Comb.
Brian K. Miceli, Jeffrey B. Remmel
2008 J jnl
Consistency properties and set based logic programming.
Ann. Math. Artif. Intell.
Anil Nerode, Jeffrey B. Remmel
2008 J jnl
Counting Descents, Rises, and Levels, with Prescribed First Element, in Words.
Discret. Math. Theor. Comput. Sci.
Sergey Kitaev, Toufik Mansour, Jeffrey B. Remmel
2008 J jnl
Counting descent pairs with prescribed tops and bottoms.
J. Comb. Theory A
John T. Hall, Jeffrey B. Remmel
2008 J jnl
Descents, inversions, and major indices in permutation groups.
Discret. Math.
Anthony Mendes, Jeffrey B. Remmel
2008 J jnl
My work with Victor Marek: a mathematician looks at answer set programming.
Ann. Math. Artif. Intell.
Jeffrey B. Remmel
2008 B conf
On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP.
ICLP
Victor W. Marek, Jeffrey B. Remmel
2008 J jnl
Set based logic programming.
Ann. Math. Artif. Intell.
Howard A. Blair, Victor W. Marek, Jeffrey B. Remmel
2008 J jnl
The Combinatorics of the Garsia-Haiman Modules for Hook Shapes.
Electron. J. Comb.
Ron M. Adin, Jeffrey B. Remmel, Yuval Roichman
2008 A* conf
The chase revisited.
PODS
Alin Deutsch, Alan Nash, Jeffrey B. Remmel
2007 Misc conf
Compactness Properties for Stable Semantics of Logic Programs.
LFCS
Victor W. Marek, Jeffrey B. Remmel
2007 J jnl
Compactness Properties for Stable Semantics of Logic Programs.
Fundam. Informaticae
Victor W. Marek, Jeffrey B. Remmel
2006 J jnl
Classifying Descents According to Equivalence mod k.
Electron. J. Comb.
Sergey Kitaev, Jeffrey B. Remmel
2006 J jnl
Complexity, decidability and completeness.
J. Symb. Log.
Douglas A. Cenzer, Jeffrey B. Remmel
2006 J jnl
Enumeration of
Adv. Appl. Math.
Thomas M. Langley, Jeffrey B. Remmel
2006 J jnl
Infinitely-Often Universal Languages and Diagonalization.
Electron. Colloquium Comput. Complex.
Alan Nash, Russell Impagliazzo, Jeffrey B. Remmel
2006 J jnl
Lyndon Words and Transition Matrices between Elementary, Homogeneous and Monomial Symmetric Functions.
Electron. J. Comb.
Andrius Kulikauskas, Jeffrey B. Remmel
2006 J jnl
On the complexity of inductive definitions.
Math. Struct. Comput. Sci.
Douglas A. Cenzer, Jeffrey B. Remmel
2006 J jnl
Permutations and words counted by consecutive patterns.
Adv. Appl. Math.
Anthony Mendes, Jeffrey B. Remmel
2006 C conf
Random Continuous Functions.
CCA
Paul Brodhead, Douglas Cenzer, Jeffrey B. Remmel
2005 J jnl
Logic programming with infinite sets.
Ann. Math. Artif. Intell.
Douglas A. Cenzer, Jeffrey B. Remmel, Victor W. Marek
2005 — conf
Normal Form Theorem for Logic Programs with Cardinality Constraints.
Nonmonotonic Reasoning, Answer Set Programming and Constraints
Victor W. Marek, Jeffrey B. Remmel
2005 A conf
PTIME Queries Revisited.
ICDT
Alan Nash, Jeffrey B. Remmel, Victor Vianu
2005 — conf
Set Based Logic Programming.
Nonmonotonic Reasoning, Answer Set Programming and Constraints
Jeffrey B. Remmel, Victor W. Marek
2005 J jnl
Statistics on wreath products, perfect matchings, and signed words.
Eur. J. Comb.
James Haglund, Nicholas A. Loehr, Jeffrey B. Remmel
2005 C conf
The Complexity of Inductive Definability.
CiE
Douglas A. Cenzer, Jeffrey B. Remmel
2004 J jnl
A Class Of Graphs Which Has Efficient Ranking And Unranking Algorithms For Spanning Trees And Forests.
Int. J. Found. Comput. Sci.
Ömer Egecioglu, Jeffrey B. Remmel, S. G. Williamson
2004 J jnl
A lambda-ring Frobenius Characteristic for G wreath S
Electron. J. Comb.
Anthony Mendes, Jeffrey B. Remmel, Jennifer Wagner
2004 — conf
Answer set programming with default logic.
NMR
Victor W. Marek, Jeffrey B. Remmel
2004 J jnl
Conjectured Combinatorial Models for the Hilbert Series of Generalized Diagonal Harmonics Modules.
Electron. J. Comb.
Nicholas A. Loehr, Jeffrey B. Remmel
2004 J jnl
Cycles and perfect matchings.
Discret. Math.
James Haglund, Jeffrey B. Remmel
2004 — conf
Finding stable models via quantum computation.
NMR
David A. Meyer, James Pommersheim, Jeffrey B. Remmel
2004 J jnl
Index sets for computable differential equations.
Math. Log. Q.
Douglas Cenzer, Jeffrey B. Remmel
2004 J jnl
Locally Determined Logic Programs and Recursive Stable Models.
Ann. Math. Artif. Intell.
Douglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt
2004 J jnl
Rook Theory, Generalized Stirling Numbers and (p, q)-Analogues.
Electron. J. Comb.
Jeffrey B. Remmel, Michelle L. Wachs
2004 B conf
Set Constraints in Logic Programming.
LPNMR
V. Wiktor Marek, Jeffrey B. Remmel
2004 J jnl
The Plethysm s
Electron. J. Comb.
Thomas M. Langley, Jeffrey B. Remmel
2004 — conf
Using Logic Programs to Reason about Infinite Sets.
AI&M
Douglas Cenzer, V. Wiktor Marek, Jeffrey B. Remmel
2003 J jnl
A p, q-analogue of a Formula of Frobenius.
Electron. J. Comb.
Karen S. Briggs, Jeffrey B. Remmel
2003 J jnl
Index sets for omega-languages.
Math. Log. Q.
Douglas A. Cenzer, Jeffrey B. Remmel
2003 J jnl
On the Expressibility of Stable Logic Programming
CoRR
V. Wiktor Marek, Jeffrey B. Remmel
2003 J jnl
On the expressibility of stable logic programming.
Theory Pract. Log. Program.
V. Wiktor Marek, Jeffrey B. Remmel
2003 A conf
Universal Languages and the Power of Diagonalization.
CCC
Alan Nash, Russell Impagliazzo, Jeffrey B. Remmel
2002 J jnl
Effectively closed sets and graphs of computable real functions.
Theor. Comput. Sci.
Douglas A. Cenzer, Jeffrey B. Remmel
2002 — conf
On logic programs with cardinality constraints.
NMR
Victor W. Marek, Jeffrey B. Remmel
2002 J jnl
Spanning Trees and Function Classes.
Electron. J. Comb.
Jeffrey B. Remmel, S. G. Williamson
2001 B conf
On the Expressibility of Stable Logic Programming.
LPNMR
V. Wiktor Marek, Jeffrey B. Remmel
2001 — conf
On the Foundations of Answer Set Programming.
Answer Set Programming
Victor W. Marek, Jeffrey B. Remmel
2001 J jnl
Rook Theory for Perfect Matchings.
Adv. Appl. Math.
James Haglund, Jeffrey B. Remmel
2000 — conf
Characterizing the Set of Extensions of a Nonmonotonic Rule System with Levels.
AI&M
Douglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt
1999 J jnl
Index Sets in Computable Analysis.
Theor. Comput. Sci.
Douglas A. Cenzer, Jeffrey B. Remmel
1999 J jnl
Large-Scale Regularities of Lattice Embeddings of Posets.
Order
Jeffrey B. Remmel, S. Gill Williamson
1999 B conf
Locally Determined Logic Programs.
LPNMR
Douglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt
1999 J jnl
Logic Programs, Well-Orderings, and Forward Chaining.
Ann. Pure Appl. Log.
V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
1998 J jnl
A simple proof of the Littlewood-Richardson rule and applications.
Discret. Math.
Jeffrey B. Remmel, Mark Shimozono
1998 J jnl
Complexity and Categoricity.
Inf. Comput.
Douglas A. Cenzer, Jeffrey B. Remmel
1998 J jnl
Feasible Graphs with Standard Universe.
Ann. Pure Appl. Log.
Douglas A. Cenzer, Jeffrey B. Remmel
1998 J jnl
Formulas for the expansion of the plethysms s
Discret. Math.
Luisa Carini, Jeffrey B. Remmel
1998 J jnl
Hook-Schur Functions Analogues of Littlewood's Identities and their Bijective Proofs.
Eur. J. Comb.
Mei Yang, Jeffrey B. Remmel
1998 J jnl
Index Sets for Pi
Ann. Pure Appl. Log.
Douglas A. Cenzer, Jeffrey B. Remmel
1998 J jnl
Preface.
Ann. Pure Appl. Log.
Douglas A. Cenzer, Jeffrey B. Remmel
1997 J jnl
Annotated Nonmonotonic Rule Systems.
Theor. Comput. Sci.
Anil Nerode, Jeffrey B. Remmel, V. S. Subrahmanian
1997 Misc conf
Basic Forward Chaining Construction for Logic Programs.
LFCS
V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
1997 J jnl
Complexity of Recursive Normal Default Logic.
Fundam. Informaticae
V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
1997 — conf
Hybrid Dynamic Programming.
HART
Wolf Kohn, Jeffrey B. Remmel
1997 B conf
Non-Monotonic Reasoning with Quantified Boolean Constraints.
LPNMR
Ch. Pollet, Jeffrey B. Remmel
1997 J jnl
Nonmonotonic rule systems with recursive sets of restraints.
Arch. Math. Log.
V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
1997 J jnl
Quasi-Simple Relations in Copies of a Given Recursive Structure.
Ann. Pure Appl. Log.
Christopher J. Ash, Julia F. Knight, Jeffrey B. Remmel
1997 — conf
Scalble Data and Sensor Fusion via Multiple Agent Hybrid Systems.
Hybrid Systems
Wolf Kohn, Anil Nerode, Jeffrey B. Remmel
1996 — conf
Agent Based Velocity Control of Highway Systems.
Hybrid Systems
Wolf Kohn, Anil Nerode, Jeffrey B. Remmel
1996 J jnl
Combinatorics of theq-Basis of Symmetric Functions.
J. Comb. Theory A
Arun Ram, Jeffrey B. Remmel, Tamsen Whitehead
1996 — conf
Hybrid System Games: Extraction of Control Automata with Small Topologies.
Hybrid Systems
Anil Nerode, Jeffrey B. Remmel, Alexander Yakhnis
1996 J jnl
McNaughton Games and Extracting Strategies for Concurrent Programs.
Ann. Pure Appl. Log.
Anil Nerode, Jeffrey B. Remmel, Alexander Yakhnis
1996 B conf
Nonmonotonic Rule Systems: Foward Chaining, Constraints, and Complexity (Abstract).
MFCS
Jeffrey B. Remmel
1996 A* conf
On the Complexity of Abduction.
LICS
V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
1996 J jnl
On the Lattices of NP-Subspaces of a Polynomial Time Vector Space over a Finite Field.
Ann. Pure Appl. Log.
Anil Nerode, Jeffrey B. Remmel
1996 J jnl
The combinatorics of transition matrices between the bases of the symmetric functions and the B
Discret. Math.
Desiree A. Beck, Jeffrey B. Remmel, Tamsen Whitehead
1995 J jnl
A Combinatorial Proof of the Equivalence of the Classical and Combinatorial Definitions of Schur Function.
J. Comb. Theory A
Joaquin O. Carbonara, Jeffrey B. Remmel, Andrius Kulikauskas
1995 A* conf
Complexity of Normal Default Logic and Related Modes of Nonmonotonic Reasoning
LICS
V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
1995 J jnl
Feasible Graphs and Colorings.
Math. Log. Q.
Jeffrey B. Remmel, Douglas A. Cenzer
1995 — conf
Hybrid Systems: Chattering Approximation to Relaxed Controls.
Hybrid Systems
Xiaolin Ge, Wolf Kohn, Anil Nerode, Jeffrey B. Remmel
1995 B conf
On Logical Constraints in Logic Programming.
LPNMR
V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
1995 J jnl
Permutation Enumeration of the Symmetric Group and the Combinatorics of Symmetric Functions.
J. Comb. Theory A
Desiree A. Beck, Jeffrey B. Remmel
1995 J jnl
Viability in Hybrid Systems.
Theor. Comput. Sci.
Wolf Kohn, Anil Nerode, Jeffrey B. Remmel, Alexander Yakhnis
1994 J jnl
A Context for Belief Revision: Forward Chaining - Normal Nonmonotonic Rule Systems.
Ann. Pure Appl. Log.
V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
1994 — conf
Controllers as Fixed Points of Set-Valued Operators.
Hybrid Systems
Anil Nerode, Jeffrey B. Remmel, Alexander Yakhnis
1994 — conf
Feasibly Categorial Models.
LCC
Douglas A. Cenzer, Jeffrey B. Remmel
1994 — conf
Hybrid Systems as Finsler Manifolds: Finite State Control as Approximation to Connections.
Hybrid Systems
Wolf Kohn, Anil Nerode, Jeffrey B. Remmel
1994 — conf
On Logical Constraints in Logic Programming.
ILPS Workshop: Constraints and Databases
V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
1994 J jnl
On Speedable and Levelable Vector Spaces.
Ann. Pure Appl. Log.
Frank A. Bäuerle, Jeffrey B. Remmel
1994 J jnl
Proofs, programs, and run times.
Methods Log. Comput. Sci.
John N. Crossley, Jeffrey B. Remmel
1994 J jnl
The Stable Models of a Predicate Logic Program.
J. Log. Program.
V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
1992 J jnl
A Theory of Nonmonotonic Rule Systems II.
Ann. Math. Artif. Intell.
V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
1992 J jnl
Cancellation Laws for Polynomial-Time p-Isolated Sets.
Ann. Pure Appl. Log.
John N. Crossley, Jeffrey B. Remmel
1992 J jnl
Formulas for the expansion of the Kronecker products S
Discret. Math.
Jeffrey B. Remmel
1992 J jnl
How Complicated is the Set of Stable Models of a Recursive Logic Program?
Ann. Pure Appl. Log.
V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
1992 — ed.
Informal Proceedings of the Workshop Structural Complexity and Recursion-theoretic methods in Logic-Programming, Washington, DC, USA, November 13, 1992
Structural Complexity and Recursion-theoretic methods in Logic-Programming
Howard A. Blair, V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
1992 J jnl
Polynomial-Time Abelian Groups.
Ann. Pure Appl. Log.
Douglas A. Cenzer, Jeffrey B. Remmel
1992 — conf
Rule Systems and Well-Orderings.
Structural Complexity and Recursion-theoretic methods in Logic-Programming
V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
1992 — conf
The Stable Models of a Predicate Logic Program.
JICSLP
V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
1991 J jnl
Brick tabloids and the connection matrices between bases of symmetric functions.
Discret. Appl. Math.
Ömer Egecioglu, Jeffrey B. Remmel
1991 J jnl
Pi
J. Symb. Log.
Carl G. Jockusch Jr., Andrew E. M. Lewis, Jeffrey B. Remmel
1991 J jnl
Polynomial-Time versus Recursive Models.
Ann. Pure Appl. Log.
Douglas A. Cenzer, Jeffrey B. Remmel
1991 J jnl
Special Rim Hook Tabloids and Some New Multiplicity-Free
SIAM J. Discret. Math.
Jeffrey B. Remmel, Mei Yang
1990 A* conf
A Theory of Nonmonotonic Rule Systems
LICS
V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
1990 J jnl
A Theory of Nonmonotonic Rule Systems I.
Ann. Math. Artif. Intell.
V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
1990 J jnl
The monomial symmetric functions and the Frobenius map.
J. Comb. Theory A
Ömer Egecioglu, Jeffrey B. Remmel
1989 J jnl
Classification of Degree Classes Associated with r.e. Subspaces.
Ann. Pure Appl. Log.
Rodney G. Downey, Jeffrey B. Remmel
1989 J jnl
Complexity-Theoretic Algebra II: Boolean Algebras.
Ann. Pure Appl. Log.
Anil Nerode, Jeffrey B. Remmel
1989 A* conf
Polynomially Grade Logic I: A Graded Version of System T
LICS
Anil Nerode, Jeffrey B. Remmel, Andre Scedrov
1987 J jnl
Automorphisms and Recursive Structures.
Math. Log. Q.
Rodney G. Downey, Jeffrey B. Remmel
1987 — conf
Complexity theoretic algebra I - vector spaces over finite fields.
SCT
Anil Nerode, Jeffrey B. Remmel
1987 J jnl
Permutation statistics and (k, l)-hook Schur functions.
Discret. Math.
Jeffrey B. Remmel
1987 J jnl
Recursively rigid Boolean algebras.
Ann. Pure Appl. Log.
Jeffrey B. Remmel
1987 J jnl
The undecidability of the lattice of R.E. closed subsets of an effective topological space.
Ann. Pure Appl. Log.
Sheryl Silibovsky Brady, Jeffrey B. Remmel
1986 J jnl
Bijections for Cayley trees, spanning trees, and their
J. Comb. Theory A
Ömer Egecioglu, Jeffrey B. Remmel
1986 J jnl
Generic objects in recursion theory II: Operations on recursive approximation spaces.
Ann. Pure Appl. Log.
Anil Nerode, Jeffrey B. Remmel
1986 J jnl
Graph colorings and recursively bounded Π
Ann. Pure Appl. Log.
Jeffrey B. Remmel
1986 J jnl
Q-counting rook configurations and a formula of frobenius.
J. Comb. Theory A
Adriano M. Garsia, Jeffrey B. Remmel
1985 J jnl
A Combinatorial View of Andrews' Proof of the L-M-W Conjectures.
Eur. J. Comb.
Adriano M. Garsia, Jeffrey B. Remmel
1985 J jnl
Shuffles of permutations and the Kronecker product.
Graphs Comb.
Adriano M. Garsia, Jeffrey B. Remmel
1984 J jnl
Effectively Nowhere Simple Sets.
J. Symb. Log.
D. Miller, Jeffrey B. Remmel
1984 J jnl
Multiplying Schur functions.
J. Algorithms
Jeffrey B. Remmel, Roger Whitney
1984 J jnl
The Universal Complementation Property.
J. Symb. Log.
Rodney G. Downey, Jeffrey B. Remmel
1984 J jnl
The Universal Splitting Property. II.
J. Symb. Log.
Manuel Lerman, Jeffrey B. Remmel
1983 J jnl
A Bijective Proof of the Hook Formula for the Number of Column Strict Tableaux with Bounded Entries.
Eur. J. Comb.
Jeffrey B. Remmel, Roger Whitney
1983 J jnl
A Note on a Recursion for the Number of Derangements.
Eur. J. Comb.
Jeffrey B. Remmel
1983 J jnl
Degrees of Recursively Enumerable Topological Spaces.
J. Symb. Log.
Iraj Kalantari, Jeffrey B. Remmel
1983 J jnl
Indiscernibles and Decidable Models.
J. Symb. Log.
Henry A. Kierstead, Jeffrey B. Remmel
1982 J jnl
Bijective Proofs of Some Classical Partition Identities.
J. Comb. Theory A
Jeffrey B. Remmel
1981 J jnl
Partial Orderings of Fixed Finite Dimension: Model Companions and Density.
J. Symb. Log.
Alfred B. Manaster, Jeffrey B. Remmel
1981 J jnl
Recursive Boolean Algebras with Recursive Atoms.
J. Symb. Log.
Jeffrey B. Remmel
1981 J jnl
Recursive Isomorphism Types of Recursive Boolean Algebras.
J. Symb. Log.
Jeffrey B. Remmel
1980 J jnl
A Combinatorial Interpretation of q-Derangement and q-Laguerre Numbers.
Eur. J. Comb.
Adriano M. Garsia, Jeffrey B. Remmel
1980 J jnl
CO-Simple Higher-Order Indecomposable Isols.
Math. Log. Q.
Jeffrey B. Remmel, Alfred B. Manaster
1980 J jnl
On R.E. and CO-R.E. Vector Spaces with Nonextendible Bases.
J. Symb. Log.
Jeffrey B. Remmel
1980 J jnl
Recursion Theory on Orderings. II.
J. Symb. Log.
Jeffrey B. Remmel
1979 J jnl
R-Maximal Boolean Algebras.
J. Symb. Log.
Jeffrey B. Remmel
1979 J jnl
Recursion Theory on Orderings. I. A Model Theoretic Setting.
J. Symb. Log.
George Metakides, Jeffrey B. Remmel
1978 J jnl
A r-Maximal Vector Space not contained in any Maximal Vector Space.
J. Symb. Log.
Jeffrey B. Remmel
1977 J jnl
Maximal and Cohesive Vector Spaces.
J. Symb. Log.
Jeffrey B. Remmel
1976 J jnl
Co-Hypersimple Structures.
J. Symb. Log.
Jeffrey B. Remmel