default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeffrey B. Remmel
Person information
- affiliation: University of California, San Diego, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2022
[j147]Sittipong Thamrongpairoj, Jeffrey B. Remmel:
Positional Marked Patterns in Permutations. Discret. Math. Theor. Comput. Sci. 24(1) (2022)- 2020
- [j146]Dun Qiu
, Jeffrey B. Remmel:
Schur function expansions and the Rational Shuffle Theorem. J. Comb. Theory A 175: 105272 (2020) - [j145]Douglas Cenzer, Victor W. Marek, Jeffrey B. Remmel:
On the complexity of index sets for finite predicate logic programs which allow function symbols. J. Log. Comput. 30(1): 107-156 (2020) - [j144]Jacob Carson, Douglas Cenzer, Jeffrey B. Remmel:
Effective Categoricity of Automatic Equivalence and Nested Equivalence Structures. Theory Comput. Syst. 64(6): 1110-1139 (2020) - 2019
- [j143]Ran Pan, Dun Qiu, Jeffrey B. Remmel:
Counting consecutive pattern matches in Sn(132) and Sn(123). Adv. Appl. Math. 105: 130-167 (2019) - [j142]Jeffrey B. Remmel, Sittipong Thamrongpairoj:
The combinatorial properties of the Benoumhani polynomials for the Whitney numbers of Dowling lattices. Discret. Math. 342(11): 2966-2983 (2019) - [j141]Dun Qiu, Jeffrey B. Remmel:
Classical pattern distributions in Sn(132) and Sn(123). Discret. Math. Theor. Comput. Sci. 21(2) (2019) - 2018
- [j140]Yong Wang, Jeffrey B. Remmel:
An iterative algorithm to eliminate edges for traveling salesman problem based on a new binomial distribution - Eliminating edges for TSP. Appl. Intell. 48(11): 4470-4484 (2018) - [j139]Dun Qiu, Jeffrey B. Remmel, Emily Sergel, Guoce Xin:
On the Schur Positivity of Δe2 en[X]. Electron. J. Comb. 25(4): P4.20 (2018) - 2017
- [j138]Jeffrey B. Remmel, Sai-Nan Zheng:
Rises in forests of binary shrubs. Discret. Math. Theor. Comput. Sci. 19(1) (2017) - 2016
- [j137]Jeffrey B. Remmel, Janine LoBue Tiefenbruck:
Q-analogues of convolutions of Fibonacci numbers. Australas. J Comb. 64: 166-193 (2016) - [j136]Quang T. Bach, Jeffrey B. Remmel:
Generating functions for descents over permutations which avoid sets of consecutive patterns. Australas. J Comb. 64: 194-231 (2016) - [j135]Quang T. Bach, Jeffrey B. Remmel:
Descent c-Wilf Equivalence. Discret. Math. Theor. Comput. Sci. 18(2) (2016) - [j134]Ran Pan, Jeffrey B. Remmel:
Asymptotics for minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shape, and column strict arrays. Discret. Math. Theor. Comput. Sci. 18(2) (2016) - [j133]Kenneth Barrese, Nicholas A. Loehr, Jeffrey B. Remmel, Bruce E. Sagan:
Bijections on m-level rook placements. Eur. J. Comb. 57: 13-35 (2016) - [j132]Yong Wang, Jeffrey B. Remmel:
A Binomial Distribution Model for the Traveling Salesman Problem Based on Frequency Quadrilaterals. J. Graph Algorithms Appl. 20(2): 411-434 (2016) - 2015
- [j131]Miles Eli Jones, Sergey Kitaev, Artem V. Pyatkin, Jeffrey B. Remmel:
Representing Graphs via Pattern Avoiding Words. Electron. J. Comb. 22(2): 2 (2015) - [j130]Sergey Kitaev, Jeffrey B. Remmel:
(a, b)-rectangle patterns in permutations and words. Discret. Appl. Math. 186: 128-146 (2015) - [j129]Miles Eli Jones, Sergey Kitaev, Jeffrey B. Remmel:
Frame patterns in n-cycles. Discret. Math. 338(7): 1197-1215 (2015) - [j128]Sergey Kitaev, Jeffrey B. Remmel, Mark Tiefenbruck:
Quadrant Marked Mesh Patterns in 132-Avoiding Permutations II. Integers 15: A16 (2015) - [j127]Sergey Kitaev, Jeffrey B. Remmel, Mark Tiefenbruck:
Quadrant Marked Mesh Patterns in 132-avoiding Permutations III. Integers 15: A39 (2015) - [j126]Jeffrey B. Remmel, Andrew Timothy Wilson:
An extension of MacMahon's equidistribution theorem to ordered set partitions. J. Comb. Theory A 134: 242-277 (2015) - 2014
- [j125]Alex Brik, Jeffrey B. Remmel:
Hybrid Answer Set Programming. Ann. Pure Appl. Log. 165(1): 134-163 (2014) - [j124]Jeffrey B. Remmel:
Consecutive Up-down Patterns in Up-down Permutations. Electron. J. Comb. 21(3): 3 (2014) - [j123]Sam Buss, Douglas Cenzer, Jeffrey B. Remmel:
Sub-computable Boundedness Randomness. Log. Methods Comput. Sci. 10(4) (2014) - [j122]Kenneth Barrese, Nicholas A. Loehr, Jeffrey B. Remmel, Bruce E. Sagan:
m-Level rook placements. J. Comb. Theory A 124: 130-165 (2014) - [j121]Sergey Kitaev, Jeffrey B. Remmel:
The 1-Box Pattern on Pattern-Avoiding Permutations. J. Integer Seq. 17(3): 14.3.3 (2014) - 2013
- [j120]Miles Eli Jones, Jeffrey B. Remmel:
A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of a permutation pattern. Discret. Math. 313(23): 2712-2729 (2013) - [j119]Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel:
Two-to-one structures. J. Log. Comput. 23(6): 1195-1223 (2013) - 2012
- [j118]Douglas Cenzer, Jeffrey B. Remmel:
A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs. Ann. Math. Artif. Intell. 65(1): 1-24 (2012) - 2011
- [j117]Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel:
Σ01 and Π01 equivalence structures. Ann. Pure Appl. Log. 162(7): 490-503 (2011) - [j116]Adrian Duane, Jeffrey B. Remmel:
Minimal Overlapping Patterns in Colored Permutations. Electron. J. Comb. 18(2) (2011) - [j115]Sergey Kitaev, Jeffrey B. Remmel:
Enumerating (2+2)-free posets by the number of minimal elements and other statistics. Discret. Appl. Math. 159(17): 2098-2108 (2011) - [j114]Evan Fuller, Jeffrey B. Remmel:
Quasi-symmetric functions and up-down compositions. Discret. Math. 311(16): 1754-1767 (2011) - [j113]Victor W. Marek, Jeffrey B. Remmel:
Guarded resolution for Answer Set Programming. Theory Pract. Log. Program. 11(1): 111-123 (2011) - 2010
- [j112]Jeffrey B. Remmel, Manda Riehl:
Generating Functions for Permutations which Contain a Given Descent Set. Electron. J. Comb. 17(1) (2010) - [j111]Sergey Kitaev, Jeffrey B. Remmel:
Place-Difference-Value Patterns: A Generalization of Generalized Permutation and Word Patterns. Integers 10: A11 (2010) - 2009
- [j110]Nicholas A. Loehr, Jeffrey B. Remmel:
Rook-by-rook rook theory: Bijective proofs of rook and hit equivalences. Adv. Appl. Math. 42(4): 483-503 (2009) - [j109]Douglas Cenzer, Rodney G. Downey, Jeffrey B. Remmel, Zia Uddin:
Space complexity of Abelian groups. Arch. Math. Log. 48(1): 115-140 (2009) - [j108]Victor W. Marek, Jeffrey B. Remmel:
The complexity of recursive constraint satisfaction problems. Ann. Pure Appl. Log. 161(3): 447-457 (2009) - [j107]John T. Hall, Jeffrey Liese, Jeffrey B. Remmel:
q-Counting Descent Pairs with Prescribed Tops and Bottoms. Electron. J. Comb. 16(1) (2009) - [j106]Sergey Kitaev, Jeffrey Liese, Jeffrey B. Remmel, Bruce E. Sagan:
Rationality, Irrationality, and Wilf Equivalence in Generalized Factor Order. Electron. J. Comb. 16(2) (2009) - [j105]Douglas Cenzer, Geoffrey LaForte, Jeffrey B. Remmel:
Equivalence structures and isomorphisms in the difference hierarchy. J. Symb. Log. 74(2): 535-556 (2009) - [j104]George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber:
K-Triviality of Closed Sets and Continuous Functions. J. Log. Comput. 19(1): 3-16 (2009) - 2008
- [j103]Howard A. Blair, Victor W. Marek, Jeffrey B. Remmel:
Set based logic programming. Ann. Math. Artif. Intell. 52(1): 81-105 (2008) - [j102]Jeffrey B. Remmel:
My work with Victor Marek: a mathematician looks at answer set programming. Ann. Math. Artif. Intell. 53(1-4): 5-16 (2008) - [j101]Anil Nerode, Jeffrey B. Remmel:
Consistency properties and set based logic programming. Ann. Math. Artif. Intell. 53(1-4): 289-311 (2008) - [j100]George Barmpalias, Paul Brodhead, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber:
Algorithmic randomness of continuous functions. Arch. Math. Log. 46(7-8): 533-546 (2008) - [j99]Ron M. Adin, Jeffrey B. Remmel, Yuval Roichman:
The Combinatorics of the Garsia-Haiman Modules for Hook Shapes. Electron. J. Comb. 15(1) (2008) - [j98]Brian K. Miceli, Jeffrey B. Remmel:
Augmented Rook Boards and General Product Formulas. Electron. J. Comb. 15(1) (2008) - [j97]Anthony Mendes, Jeffrey B. Remmel:
Descents, inversions, and major indices in permutation groups. Discret. Math. 308(12): 2509-2524 (2008) - [j96]Sergey Kitaev, Toufik Mansour, Jeffrey B. Remmel:
Counting Descents, Rises, and Levels, with Prescribed First Element, in Words. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - [j95]John T. Hall, Jeffrey B. Remmel:
Counting descent pairs with prescribed tops and bottoms. J. Comb. Theory A 115(5): 693-725 (2008) - 2007
- [j94]Victor W. Marek, Jeffrey B. Remmel:
Compactness Properties for Stable Semantics of Logic Programs. Fundam. Informaticae 81(1-3): 211-239 (2007) - 2006
- [j93]Thomas M. Langley, Jeffrey B. Remmel:
Enumeration of m-tuples of permutations and a new class of power bases for the space of symmetric functions. Adv. Appl. Math. 36(1): 30-66 (2006) - [j92]Anthony Mendes, Jeffrey B. Remmel:
Permutations and words counted by consecutive patterns. Adv. Appl. Math. 37(4): 443-480 (2006) - [j91]Sergey Kitaev, Jeffrey B. Remmel:
Classifying Descents According to Equivalence mod k. Electron. J. Comb. 13(1) (2006) - [j90]Andrius Kulikauskas, Jeffrey B. Remmel:
Lyndon Words and Transition Matrices between Elementary, Homogeneous and Monomial Symmetric Functions. Electron. J. Comb. 13(1) (2006) - [j89]Karen S. Briggs, Jeffrey B. Remmel:
m-Rook numbers and a generalization of a formula of Frobenius to Cm Sn. J. Comb. Theory A 113(6): 1138-1171 (2006) - [j88]Douglas A. Cenzer, Jeffrey B. Remmel:
Complexity, decidability and completeness. J. Symb. Log. 71(2): 399-424 (2006) - [j87]Douglas A. Cenzer, Jeffrey B. Remmel:
On the complexity of inductive definitions. Math. Struct. Comput. Sci. 16(5): 763-788 (2006) - 2005
- [j86]Douglas A. Cenzer, Jeffrey B. Remmel, Victor W. Marek:
Logic programming with infinite sets. Ann. Math. Artif. Intell. 44(4): 309-339 (2005) - [j85]James Haglund, Nicholas A. Loehr, Jeffrey B. Remmel:
Statistics on wreath products, perfect matchings, and signed words. Eur. J. Comb. 26(6): 835-868 (2005) - 2004
- [j84]Douglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt:
Locally Determined Logic Programs and Recursive Stable Models. Ann. Math. Artif. Intell. 40(3-4): 225-262 (2004) - [j83]Thomas M. Langley, Jeffrey B. Remmel:
The Plethysm sλ[sμ] at Hook and Near-Hook Shapes. Electron. J. Comb. 11(1) (2004) - [j82]Nicholas A. Loehr, Jeffrey B. Remmel:
Conjectured Combinatorial Models for the Hilbert Series of Generalized Diagonal Harmonics Modules. Electron. J. Comb. 11(1) (2004) - [j81]Anthony Mendes, Jeffrey B. Remmel, Jennifer Wagner:
A lambda-ring Frobenius Characteristic for G wreath Sn. Electron. J. Comb. 11(1) (2004) - [j80]Jeffrey B. Remmel, Michelle L. Wachs:
Rook Theory, Generalized Stirling Numbers and (p, q)-Analogues. Electron. J. Comb. 11(1) (2004) - [j79]James Haglund, Jeffrey B. Remmel:
Cycles and perfect matchings. Discret. Math. 274(1-3): 93-108 (2004) - [j78]Ömer Egecioglu, Jeffrey B. Remmel, S. G. Williamson:
A Class Of Graphs Which Has Efficient Ranking And Unranking Algorithms For Spanning Trees And Forests. Int. J. Found. Comput. Sci. 15(4): 619-648 (2004) - [j77]Douglas Cenzer, Jeffrey B. Remmel:
Index sets for computable differential equations. Math. Log. Q. 50(4-5): 329-344 (2004) - 2003
- [j76]Karen S. Briggs, Jeffrey B. Remmel:
A p, q-analogue of a Formula of Frobenius. Electron. J. Comb. 10 (2003) - [j75]Douglas A. Cenzer, Jeffrey B. Remmel:
Index sets for omega-languages. Math. Log. Q. 49(1): 22-33 (2003) - [j74]V. Wiktor Marek, Jeffrey B. Remmel:
On the expressibility of stable logic programming. Theory Pract. Log. Program. 3(4-5): 551-567 (2003) - 2002
- [j73]Jeffrey B. Remmel, S. G. Williamson:
Spanning Trees and Function Classes. Electron. J. Comb. 9(1) (2002) - [j72]Douglas A. Cenzer, Jeffrey B. Remmel:
Effectively closed sets and graphs of computable real functions. Theor. Comput. Sci. 284(2): 279-318 (2002) - 2001
- [j71]James Haglund, Jeffrey B. Remmel:
Rook Theory for Perfect Matchings. Adv. Appl. Math. 27(Issues): 438-481 (2001) - 1999
- [j70]V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
Logic Programs, Well-Orderings, and Forward Chaining. Ann. Pure Appl. Log. 96(1-3): 231-276 (1999) - [j69]Jeffrey B. Remmel, S. Gill Williamson:
Large-Scale Regularities of Lattice Embeddings of Posets. Order 16(3): 245-260 (1999) - [j68]Douglas A. Cenzer, Jeffrey B. Remmel:
Index Sets in Computable Analysis. Theor. Comput. Sci. 219(1-2): 111-150 (1999) - 1998
- [j67]Douglas A. Cenzer, Jeffrey B. Remmel:
Preface. Ann. Pure Appl. Log. 93(1-3): 1-2 (1998) - [j66]Douglas A. Cenzer, Jeffrey B. Remmel:
Index Sets for Pi01 Classes. Ann. Pure Appl. Log. 93(1-3): 3-61 (1998) - [j65]Douglas A. Cenzer, Jeffrey B. Remmel:
Feasible Graphs with Standard Universe. Ann. Pure Appl. Log. 94(1-3): 21-35 (1998) - [j64]Luisa Carini, Jeffrey B. Remmel:
Formulas for the expansion of the plethysms s2[S(a, b)] and S2[S(nk)]. Discret. Math. 193(1-3): 147-177 (1998) - [j63]Jeffrey B. Remmel, Mark Shimozono:
A simple proof of the Littlewood-Richardson rule and applications. Discret. Math. 193(1-3): 257-266 (1998) - [j62]Mei Yang, Jeffrey B. Remmel:
Hook-Schur Functions Analogues of Littlewood's Identities and their Bijective Proofs. Eur. J. Comb. 19(2): 257-272 (1998) - [j61]Douglas A. Cenzer, Jeffrey B. Remmel:
Complexity and Categoricity. Inf. Comput. 140(1): 2-25 (1998) - 1997
- [j60]V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
Nonmonotonic rule systems with recursive sets of restraints. Arch. Math. Log. 36(4-5): 339-384 (1997) - [j59]Christopher J. Ash, Julia F. Knight, Jeffrey B. Remmel:
Quasi-Simple Relations in Copies of a Given Recursive Structure. Ann. Pure Appl. Log. 86(3): 203-218 (1997) - [j58]V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
Complexity of Recursive Normal Default Logic. Fundam. Informaticae 32(2): 139-147 (1997) - [j57]Anil Nerode, Jeffrey B. Remmel, V. S. Subrahmanian:
Annotated Nonmonotonic Rule Systems. Theor. Comput. Sci. 171(1-2): 111-146 (1997) - 1996
- [j56]Anil Nerode, Jeffrey B. Remmel, Alexander Yakhnis:
McNaughton Games and Extracting Strategies for Concurrent Programs. Ann. Pure Appl. Log. 78(1-3): 203-242 (1996) - [j55]Anil Nerode, Jeffrey B. Remmel:
On the Lattices of NP-Subspaces of a Polynomial Time Vector Space over a Finite Field. Ann. Pure Appl. Log. 81(1-3): 125-170 (1996) - [j54]Desiree A. Beck, Jeffrey B. Remmel, Tamsen Whitehead:
The combinatorics of transition matrices between the bases of the symmetric functions and the Bn analogues. Discret. Math. 153(1-3): 3-27 (1996) - [j53]Arun Ram, Jeffrey B. Remmel, Tamsen Whitehead:
Combinatorics of theq-Basis of Symmetric Functions. J. Comb. Theory A 76(2): 231-271 (1996) - 1995
- [j52]Desiree A. Beck, Jeffrey B. Remmel:
Permutation Enumeration of the Symmetric Group and the Combinatorics of Symmetric Functions. J. Comb. Theory A 72(1): 1-49 (1995) - [j51]Joaquin O. Carbonara, Jeffrey B. Remmel, Andrius Kulikauskas:
A Combinatorial Proof of the Equivalence of the Classical and Combinatorial Definitions of Schur Function. J. Comb. Theory A 72(2): 293-301 (1995) - [j50]Jeffrey B. Remmel, Douglas A. Cenzer:
Feasible Graphs and Colorings. Math. Log. Q. 41: 327-352 (1995) - [j49]Wolf Kohn, Anil Nerode, Jeffrey B. Remmel, Alexander Yakhnis:
Viability in Hybrid Systems. Theor. Comput. Sci. 138(1): 141-168 (1995) - 1994
- [j48]Frank A. Bäuerle, Jeffrey B. Remmel:
On Speedable and Levelable Vector Spaces. Ann. Pure Appl. Log. 67(1-3): 61-112 (1994) - [j47]V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
A Context for Belief Revision: Forward Chaining - Normal Nonmonotonic Rule Systems. Ann. Pure Appl. Log. 67(1-3): 269-323 (1994) - [j46]V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
The Stable Models of a Predicate Logic Program. J. Log. Program. 21(3): 129-153 (1994) - [j45]John N. Crossley, Jeffrey B. Remmel:
Proofs, programs, and run times. Methods Log. Comput. Sci. 1(2): 183-215 (1994) - 1992
- [j44]V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
A Theory of Nonmonotonic Rule Systems II. Ann. Math. Artif. Intell. 5(2-4): 229-263 (1992) - [j43]V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
How Complicated is the Set of Stable Models of a Recursive Logic Program? Ann. Pure Appl. Log. 56(1-3): 119-135 (1992) - [j42]John N. Crossley, Jeffrey B. Remmel:
Cancellation Laws for Polynomial-Time p-Isolated Sets. Ann. Pure Appl. Log. 56(1-3): 147-172 (1992) - [j41]Douglas A. Cenzer, Jeffrey B. Remmel:
Polynomial-Time Abelian Groups. Ann. Pure Appl. Log. 56(1-3): 313-363 (1992) - [j40]Jeffrey B. Remmel:
Formulas for the expansion of the Kronecker products S(m, n) * S(1p-r, r) and S(1k2l) * S(1p-r, r). Discret. Math. 99(1-3): 265-287 (1992) - 1991
- [j39]Douglas A. Cenzer, Jeffrey B. Remmel:
Polynomial-Time versus Recursive Models. Ann. Pure Appl. Log. 54(1): 17-58 (1991) - [j38]Ömer Egecioglu, Jeffrey B. Remmel:
Brick tabloids and the connection matrices between bases of symmetric functions. Discret. Appl. Math. 34(1-3): 107-120 (1991) - [j37]Carl G. Jockusch Jr., Andrew E. M. Lewis, Jeffrey B. Remmel:
Pi01-Classes and Rado's Selection Principle. J. Symb. Log. 56(2): 684-693 (1991) - [j36]Jeffrey B. Remmel, Mei Yang:
Special Rim Hook Tabloids and Some New Multiplicity-Free S-Series. SIAM J. Discret. Math. 4(2): 253-274 (1991) - 1990
- [j35]V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
A Theory of Nonmonotonic Rule Systems I. Ann. Math. Artif. Intell. 1: 241-273 (1990) - [j34]Ömer Egecioglu, Jeffrey B. Remmel:
The monomial symmetric functions and the Frobenius map. J. Comb. Theory A 54(2): 272-295 (1990) - 1989
- [j33]Rodney G. Downey, Jeffrey B. Remmel:
Classification of Degree Classes Associated with r.e. Subspaces. Ann. Pure Appl. Log. 42(2): 105-124 (1989) - [j32]Anil Nerode, Jeffrey B. Remmel:
Complexity-Theoretic Algebra II: Boolean Algebras. Ann. Pure Appl. Log. 44(1-2): 71-99 (1989) - 1987
- [j31]Sheryl Silibovsky Brady, Jeffrey B. Remmel:
The undecidability of the lattice of R.E. closed subsets of an effective topological space. Ann. Pure Appl. Log. 35: 193-203 (1987) - [j30]Jeffrey B. Remmel:
Recursively rigid Boolean algebras. Ann. Pure Appl. Log. 36: 39-52 (1987) - [j29]Jeffrey B. Remmel:
Permutation statistics and (k, l)-hook Schur functions. Discret. Math. 67(3): 271-298 (1987) - [j28]Rodney G. Downey, Jeffrey B. Remmel:
Automorphisms and Recursive Structures. Math. Log. Q. 33(4): 339-345 (1987) - 1986
- [j27]Anil Nerode, Jeffrey B. Remmel:
Generic objects in recursion theory II: Operations on recursive approximation spaces. Ann. Pure Appl. Log. 31: 257-288 (1986) - [j26]Jeffrey B. Remmel:
Graph colorings and recursively bounded Π10-classes. Ann. Pure Appl. Log. 32: 185-194 (1986) - [j25]Adriano M. Garsia, Jeffrey B. Remmel:
Q-counting rook configurations and a formula of frobenius. J. Comb. Theory A 41(2): 246-275 (1986) - [j24]Ömer Egecioglu, Jeffrey B. Remmel:
Bijections for Cayley trees, spanning trees, and their q-analogues. J. Comb. Theory A 42(1): 15-30 (1986) - 1985
- [j23]Adriano M. Garsia, Jeffrey B. Remmel:
A Combinatorial View of Andrews' Proof of the L-M-W Conjectures. Eur. J. Comb. 6(4): 335-352 (1985) - [j22]Adriano M. Garsia, Jeffrey B. Remmel:
Shuffles of permutations and the Kronecker product. Graphs Comb. 1(1): 217-263 (1985) - 1984
- [j21]Jeffrey B. Remmel, Roger Whitney:
Multiplying Schur functions. J. Algorithms 5(4): 471-487 (1984) - [j20]D. Miller, Jeffrey B. Remmel:
Effectively Nowhere Simple Sets. J. Symb. Log. 49(1): 129-136 (1984) - [j19]Manuel Lerman, Jeffrey B. Remmel:
The Universal Splitting Property. II. J. Symb. Log. 49(1): 137-150 (1984) - [j18]Rodney G. Downey, Jeffrey B. Remmel:
The Universal Complementation Property. J. Symb. Log. 49(4): 1125-1136 (1984) - 1983
- [j17]Jeffrey B. Remmel, Roger Whitney:
A Bijective Proof of the Hook Formula for the Number of Column Strict Tableaux with Bounded Entries. Eur. J. Comb. 4(1): 45-63 (1983) - [j16]Jeffrey B. Remmel:
A Note on a Recursion for the Number of Derangements. Eur. J. Comb. 4(4): 371-374 (1983) - [j15]Henry A. Kierstead, Jeffrey B. Remmel:
Indiscernibles and Decidable Models. J. Symb. Log. 48(1): 21-32 (1983) - [j14]Iraj Kalantari, Jeffrey B. Remmel:
Degrees of Recursively Enumerable Topological Spaces. J. Symb. Log. 48(3): 610-622 (1983) - 1982
- [j13]Jeffrey B. Remmel:
Bijective Proofs of Some Classical Partition Identities. J. Comb. Theory A 33(3): 273-286 (1982) - 1981
- [j12]Jeffrey B. Remmel:
Recursive Isomorphism Types of Recursive Boolean Algebras. J. Symb. Log. 46(3): 572-594 (1981) - [j11]Jeffrey B. Remmel:
Recursive Boolean Algebras with Recursive Atoms. J. Symb. Log. 46(3): 595-616 (1981) - [j10]Alfred B. Manaster, Jeffrey B. Remmel:
Partial Orderings of Fixed Finite Dimension: Model Companions and Density. J. Symb. Log. 46(4): 789-802 (1981) - 1980
- [j9]Adriano M. Garsia, Jeffrey B. Remmel:
A Combinatorial Interpretation of q-Derangement and q-Laguerre Numbers. Eur. J. Comb. 1(1): 47-59 (1980) - [j8]Jeffrey B. Remmel:
On R.E. and CO-R.E. Vector Spaces with Nonextendible Bases. J. Symb. Log. 45(1): 20-34 (1980) - [j7]Jeffrey B. Remmel:
Recursion Theory on Orderings. II. J. Symb. Log. 45(2): 317-333 (1980) - [j6]Jeffrey B. Remmel, Alfred B. Manaster:
CO-Simple Higher-Order Indecomposable Isols. Math. Log. Q. 26(14-18): 279-288 (1980) - 1979
- [j5]George Metakides, Jeffrey B. Remmel:
Recursion Theory on Orderings. I. A Model Theoretic Setting. J. Symb. Log. 44(3): 383-402 (1979) - [j4]Jeffrey B. Remmel:
R-Maximal Boolean Algebras. J. Symb. Log. 44(4): 533-548 (1979) - 1978
- [j3]Jeffrey B. Remmel:
A r-Maximal Vector Space not contained in any Maximal Vector Space. J. Symb. Log. 43(3): 430-441 (1978) - 1977
- [j2]Jeffrey B. Remmel:
Maximal and Cohesive Vector Spaces. J. Symb. Log. 42(3): 400-418 (1977) - 1976
- [j1]Jeffrey B. Remmel:
Co-Hypersimple Structures. J. Symb. Log. 41(3): 611-625 (1976)
Conference and Workshop Papers
- 2018
- [c53]Yong Wang, Jeffrey B. Remmel:
A Method to Compute the Sparse Graphs for Traveling Salesman Problem Based on Frequency Quadrilaterals. FAW 2018: 286-299 - 2017
- [c52]Sam Buss, Douglas Cenzer, Mia Minnes, Jeffrey B. Remmel:
Injection Structures Specified by Finite State Transducers. Computability and Complexity 2017: 394-417 - [c51]Alex Brik, Jeffrey B. Remmel:
Action Language Hybrid AL. LPNMR 2017: 322-335 - 2016
- [c50]Douglas A. Cenzer, Victor W. Marek, Jeffrey B. Remmel:
Index Sets for Finite Normal Predicate Logic Programs with Function Symbols. LFCS 2016: 60-75 - 2015
- [c49]Alex Brik, Jeffrey B. Remmel:
Diagnosing Automatic Whitelisting for Dynamic Remarketing Ads Using Hybrid ASP. LPNMR 2015: 173-185 - 2013
- [c48]Alex Brik, Jeffrey B. Remmel:
Forward Chaining for Hybrid ASP. LFCS 2013: 74-88 - [c47]Douglas Cenzer, Jeffrey B. Remmel:
Sub-computable Bounded Pseudorandomness. LFCS 2013: 104-118 - 2012
- [c46]Victor W. Marek, Jeffrey B. Remmel:
Disjunctive Programs with Set Constraints. Correct Reasoning 2012: 471-486 - [c45]Alex Brik, Jeffrey B. Remmel:
Combining Logic, Continuous Parameters and Markov Decision Processes Using Hybrid ASP. StarAI@UAI 2012 - 2011
- [c44]Victor W. Marek, Jeffrey B. Remmel:
Effectively Reasoning about Infinite Sets in Answer Set Programming. Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning 2011: 131-147 - [c43]Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel:
Effective Categoricity of Injection Structures. CiE 2011: 51-60 - [c42]Alex Brik, Jeffrey B. Remmel:
Hybrid ASP. ICLP (Technical Communications) 2011: 40-50 - 2009
- [c41]Douglas A. Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel:
S01 and P01 Equivalence Structures. CiE 2009: 99-108 - [c40]Victor W. Marek, Jeffrey B. Remmel:
Automata and Answer Set Programming. LFCS 2009: 323-337 - 2008
- [c39]Victor W. Marek, Jeffrey B. Remmel:
On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP. ICLP 2008: 223-237 - [c38]Douglas Cenzer, Jeffrey B. Remmel:
A Connection between Cantor-Bendixson Derivatives and the Well-Founded Semantics of Logic Programs. ISAIM 2008 - [c37]Jeffrey B. Remmel:
A Mathematician Looks at Answer Set Programming. ISAIM 2008 - [c36]Alin Deutsch, Alan Nash, Jeffrey B. Remmel:
The chase revisited. PODS 2008: 149-158 - 2007
- [c35]George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber:
K -Trivial Closed Sets and Continuous Functions. CiE 2007: 135-145 - [c34]Victor W. Marek, Jeffrey B. Remmel:
Compactness Properties for Stable Semantics of Logic Programs. LFCS 2007: 379-400 - 2006
- [c33]Paul Brodhead, Douglas Cenzer, Jeffrey B. Remmel:
Random Continuous Functions. CCA 2006: 275-287 - 2005
- [c32]Douglas A. Cenzer, Jeffrey B. Remmel:
The Complexity of Inductive Definability. CiE 2005: 75-85 - [c31]Alan Nash, Jeffrey B. Remmel, Victor Vianu:
PTIME Queries Revisited. ICDT 2005: 274-288 - 2004
- [c30]Douglas Cenzer, V. Wiktor Marek, Jeffrey B. Remmel:
Using Logic Programs to Reason about Infinite Sets. AI&M 2004 - [c29]V. Wiktor Marek, Jeffrey B. Remmel:
Set Constraints in Logic Programming. LPNMR 2004: 167-179 - [c28]Victor W. Marek, Jeffrey B. Remmel:
Answer set programming with default logic. NMR 2004: 276-284 - [c27]David A. Meyer, James Pommersheim, Jeffrey B. Remmel:
Finding stable models via quantum computation. NMR 2004: 285-291 - 2003
- [c26]Alan Nash, Russell Impagliazzo, Jeffrey B. Remmel:
Universal Languages and the Power of Diagonalization. CCC 2003: 337-346 - 2002
- [c25]Victor W. Marek, Jeffrey B. Remmel:
On logic programs with cardinality constraints. NMR 2002: 219-228 - 2001
- [c24]Victor W. Marek, Jeffrey B. Remmel:
On the Foundations of Answer Set Programming. Answer Set Programming 2001 - [c23]V. Wiktor Marek, Jeffrey B. Remmel:
On the Expressibility of Stable Logic Programming. LPNMR 2001: 107-120 - 2000
- [c22]Douglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt:
Characterizing the Set of Extensions of a Nonmonotonic Rule System with Levels. AI&M 2000 - 1999
- [c21]Douglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt:
Locally Determined Logic Programs. LPNMR 1999: 34-48 - 1997
- [c20]Wolf Kohn, Anil Nerode, Jeffrey B. Remmel:
Scalble Data and Sensor Fusion via Multiple Agent Hybrid Systems. Hybrid Systems 1997: 122-141 - [c19]Wolf Kohn, Jeffrey B. Remmel:
Hybrid Dynamic Programming. HART 1997: 391-396 - [c18]V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
Basic Forward Chaining Construction for Logic Programs. LFCS 1997: 214-225 - [c17]Ch. Pollet, Jeffrey B. Remmel:
Non-Monotonic Reasoning with Quantified Boolean Constraints. LPNMR 1997: 18-39 - 1996
- [c16]Wolf Kohn, Anil Nerode, Jeffrey B. Remmel:
Agent Based Velocity Control of Highway Systems. Hybrid Systems 1996: 174-214 - [c15]Anil Nerode, Jeffrey B. Remmel, Alexander Yakhnis:
Hybrid System Games: Extraction of Control Automata with Small Topologies. Hybrid Systems 1996: 248-293 - [c14]V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
On the Complexity of Abduction. LICS 1996: 513-522 - [c13]Jeffrey B. Remmel:
Nonmonotonic Rule Systems: Foward Chaining, Constraints, and Complexity (Abstract). MFCS 1996: 113 - 1995
- [c12]Xiaolin Ge, Wolf Kohn, Anil Nerode, Jeffrey B. Remmel:
Hybrid Systems: Chattering Approximation to Relaxed Controls. Hybrid Systems 1995: 76-100 - [c11]V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
Complexity of Normal Default Logic and Related Modes of Nonmonotonic Reasoning. LICS 1995: 178-185 - [c10]V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
On Logical Constraints in Logic Programming. LPNMR 1995: 43-56 - 1994
- [c9]Wolf Kohn, Anil Nerode, Jeffrey B. Remmel:
Hybrid Systems as Finsler Manifolds: Finite State Control as Approximation to Connections. Hybrid Systems 1994: 294-321 - [c8]Anil Nerode, Jeffrey B. Remmel, Alexander Yakhnis:
Controllers as Fixed Points of Set-Valued Operators. Hybrid Systems 1994: 344-358 - [c7]Douglas A. Cenzer, Jeffrey B. Remmel:
Feasibly Categorial Models. LCC 1994: 300-312 - [c6]V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
On Logical Constraints in Logic Programming. ILPS Workshop: Constraints and Databases 1994 - 1992
- [c5]V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
Rule Systems and Well-Orderings. Structural Complexity and Recursion-theoretic methods in Logic-Programming 1992: 69-92 - [c4]V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
The Stable Models of a Predicate Logic Program. JICSLP 1992: 446-460 - 1990
- [c3]V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
A Theory of Nonmonotonic Rule Systems. LICS 1990: 79-94 - 1989
- [c2]Anil Nerode, Jeffrey B. Remmel, Andre Scedrov:
Polynomially Grade Logic I: A Graded Version of System T. LICS 1989: 375-385 - 1987
- [c1]Anil Nerode, Jeffrey B. Remmel:
Complexity theoretic algebra I - vector spaces over finite fields. SCT 1987: 218-239
Editorship
- 1992
- [e1]Howard A. Blair, V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
Informal Proceedings of the Workshop Structural Complexity and Recursion-theoretic methods in Logic-Programming, Washington, DC, USA, November 13, 1992. Mathematical Sciences Institute, Cornell University 1992 [contents]
Informal and Other Publications
- 2018
- [i9]Yong Wang, Jeffrey B. Remmel:
A Method to Compute the Sparse Graphs for Traveling Salesman Problem Based on Frequency Quadrilaterals. CoRR abs/1801.09407 (2018) - 2013
- [i8]Douglas Cenzer, Victor W. Marek, Jeffrey B. Remmel:
Index sets for Finite Normal Predicate Logic Programs. CoRR abs/1303.6555 (2013) - 2012
- [i7]Alex Brik, Jeffrey B. Remmel:
Expressing Preferences using Preference Set Constraint Atoms. CoRR abs/1203.0587 (2012) - 2009
- [i6]V. Wiktor Marek, Jeffrey B. Remmel:
Guarded resolution for answer set programming. CoRR abs/0904.3953 (2009) - [i5]Victor W. Marek, Jeffrey B. Remmel:
An Application of Proof-Theory in answer Set Programming. CoRR abs/0905.0197 (2009) - 2006
- [i4]Alan Nash, Russell Impagliazzo, Jeffrey B. Remmel:
Infinitely-Often Universal Languages and Diagonalization. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [i3]Victor W. Marek, Jeffrey B. Remmel:
Normal Form Theorem for Logic Programs with Cardinality Constraints. Nonmonotonic Reasoning, Answer Set Programming and Constraints 2005 - [i2]Jeffrey B. Remmel, Victor W. Marek:
Set Based Logic Programming. Nonmonotonic Reasoning, Answer Set Programming and Constraints 2005 - 2003
- [i1]V. Wiktor Marek, Jeffrey B. Remmel:
On the Expressibility of Stable Logic Programming. CoRR cs.AI/0312053 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
