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
2020 – today
- 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)
2010 – 2019
- 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) - [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 - [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) - 2017
- [j138]Jeffrey B. Remmel, Sai-Nan Zheng:
Rises in forests of binary shrubs. Discret. Math. Theor. Comput. Sci. 19(1) (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
- [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) - [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
- [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) - [c49]Alex Brik, Jeffrey B. Remmel:
Diagnosing Automatic Whitelisting for Dynamic Remarketing Ads Using Hybrid ASP. LPNMR 2015: 173-185 - 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) - [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 - [i8]Douglas Cenzer, Victor W. Marek, Jeffrey B. Remmel:
Index sets for Finite Normal Predicate Logic Programs. CoRR abs/1303.6555 (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) - [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 - [i7]Alex Brik, Jeffrey B. Remmel:
Expressing Preferences using Preference Set Constraint Atoms. CoRR abs/1203.0587 (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) - [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 - 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)
2000 – 2009
- 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) - [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 - [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) - 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) - [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
- [j94]Victor W. Marek, Jeffrey B. Remmel:
Compactness Properties for Stable Semantics of Logic Programs. Fundam. Informaticae 81(1-3): 211-239 (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
- [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) - [c33]Paul Brodhead, Douglas Cenzer, Jeffrey B. Remmel:
Random Continuous Functions. CCA 2006: 275-287 - [i4]Alan Nash, Russell Impagliazzo, Jeffrey B. Remmel:
Infinitely-Often Universal Languages and Diagonalization. Electron. Colloquium Comput. Complex. TR06 (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) - [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 - [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 - 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) - [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
- [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) - [c26]Alan Nash, Russell Impagliazzo, Jeffrey B. Remmel:
Universal Languages and the Power of Diagonalization. CCC 2003: 337-346 - [i1]V. Wiktor Marek, Jeffrey B. Remmel:
On the Expressibility of Stable Logic Programming. CoRR cs.AI/0312053 (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) - [c25]Victor W. Marek, Jeffrey B. Remmel:
On logic programs with cardinality constraints. NMR 2002: 219-228 - 2001
- [j71]James Haglund, Jeffrey B. Remmel:
Rook Theory for Perfect Matchings. Adv. Appl. Math. 27(Issues): 438-481 (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
1990 – 1999
- 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) - [c21]Douglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt:
Locally Determined Logic Programs. LPNMR 1999: 34-48 - 1998
- [j67]