Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarJeffrey 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
2010 – today
- 2018
[j133]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)- [j132]Qiu Dun, Jeffrey B. Remmel, Emily Sergel, Guoce Xin:
On the Schur Positivity of $\Delta_{e_2} e_n[X]$. Electr. J. Comb. 25(4): P4.20 (2018) - [c51]
- [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
- [j131]Jeffrey B. Remmel, Sai-nan Zheng:
Rises in forests of binary shrubs. Discrete Mathematics & Theoretical Computer Science 19(1) (2017) - [c50]Sam Buss, Douglas Cenzer, Mia Minnes, Jeffrey B. Remmel:
Injection Structures Specified by Finite State Transducers. Computability and Complexity 2017: 394-417 - [c49]
- 2016
- [j130]Jeffrey B. Remmel, Janine LoBue Tiefenbruck:
Q-analogues of convolutions of Fibonacci numbers. Australasian J. Combinatorics 64: 166-193 (2016) - [j129]Quang T. Bach, Jeffrey B. Remmel:
Generating functions for descents over permutations which avoid sets of consecutive patterns. Australasian J. Combinatorics 64: 194-231 (2016) - [j128]Quang T. Bach, Jeffrey B. Remmel:
Descent c-Wilf Equivalence. Discrete Mathematics & Theoretical Computer Science 18(2) (2016) - [j127]Ran Pan, Jeffrey B. Remmel:
Asymptotics for minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shape, and column strict arrays. Discrete Mathematics & Theoretical Computer Science 18(2) (2016) - [j126]Kenneth Barrese, Nicholas A. Loehr, Jeffrey B. Remmel, Bruce E. Sagan:
Bijections on m-level rook placements. Eur. J. Comb. 57: 13-35 (2016) - [j125]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) - [c48]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
- [j124]Miles Eli Jones, Sergey Kitaev, Artem V. Pyatkin, Jeffrey B. Remmel:
Representing Graphs via Pattern Avoiding Words. Electr. J. Comb. 22(2): P2.53 (2015) - [j123]Sergey Kitaev, Jeffrey B. Remmel:
(a, b)-rectangle patterns in permutations and words. Discrete Applied Mathematics 186: 128-146 (2015) - [j122]Miles Eli Jones, Sergey Kitaev, Jeffrey B. Remmel:
Frame patterns in n-cycles. Discrete Mathematics 338(7): 1197-1215 (2015) - [j121]Jeffrey B. Remmel, Andrew Timothy Wilson:
An extension of MacMahon's equidistribution theorem to ordered set partitions. J. Comb. Theory, Ser. A 134: 242-277 (2015) - [c47]Alex Brik, Jeffrey B. Remmel:
Diagnosing Automatic Whitelisting for Dynamic Remarketing Ads Using Hybrid ASP. LPNMR 2015: 173-185 - 2014
- [j120]Alex Brik, Jeffrey B. Remmel:
Hybrid Answer Set Programming. Ann. Pure Appl. Logic 165(1): 134-163 (2014) - [j119]Jeffrey B. Remmel:
Consecutive Up-down Patterns in Up-down Permutations. Electr. J. Comb. 21(3): P3.2 (2014) - [j118]Sam Buss, Douglas Cenzer, Jeffrey B. Remmel:
Sub-computable Boundedness Randomness. Logical Methods in Computer Science 10(4) (2014) - [j117]Kenneth Barrese, Nicholas A. Loehr, Jeffrey B. Remmel, Bruce E. Sagan:
m-Level rook placements. J. Comb. Theory, Ser. A 124: 130-165 (2014) - 2013
- [j116]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. Discrete Mathematics 313(23): 2712-2729 (2013) - [j115]Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel:
Two-to-one structures. J. Log. Comput. 23(6): 1195-1223 (2013) - [c46]
- [c45]
- [i8]Douglas Cenzer, Victor W. Marek, Jeffrey B. Remmel:
Index sets for Finite Normal Predicate Logic Programs. CoRR abs/1303.6555 (2013) - 2012
- [j114]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) - [c44]Victor W. Marek, Jeffrey B. Remmel:
Disjunctive Programs with Set Constraints. Correct Reasoning 2012: 471-486 - [i7]Alex Brik, Jeffrey B. Remmel:
Expressing Preferences using Preference Set Constraint Atoms. CoRR abs/1203.0587 (2012) - 2011
- [j113]Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel:
Σ01 and Π01 equivalence structures. Ann. Pure Appl. Logic 162(7): 490-503 (2011) - [j112]Adrian Duane, Jeffrey B. Remmel:
Minimal Overlapping Patterns in Colored Permutations. Electr. J. Comb. 18(2) (2011) - [j111]Sergey Kitaev, Jeffrey B. Remmel:
Enumerating (2+2)-free posets by the number of minimal elements and other statistics. Discrete Applied Mathematics 159(17): 2098-2108 (2011) - [j110]Evan Fuller, Jeffrey B. Remmel:
Quasi-symmetric functions and up-down compositions. Discrete Mathematics 311(16): 1754-1767 (2011) - [j109]Victor W. Marek, Jeffrey B. Remmel:
Guarded resolution for Answer Set Programming. TPLP 11(1): 111-123 (2011) - [c43]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 - [c42]Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel:
Effective Categoricity of Injection Structures. CiE 2011: 51-60 - [c41]
- 2010
- [j108]Jeffrey B. Remmel, Manda Riehl:
Generating Functions for Permutations which Contain a Given Descent Set. Electr. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j107]Douglas Cenzer, Rodney G. Downey, Jeffrey B. Remmel, Zia Uddin:
Space complexity of Abelian groups. Arch. Math. Log. 48(1): 115-140 (2009) - [j106]Victor W. Marek, Jeffrey B. Remmel:
The complexity of recursive constraint satisfaction problems. Ann. Pure Appl. Logic 161(3): 447-457 (2009) - [j105]John T. Hall, Jeffrey Liese, Jeffrey B. Remmel:
q-Counting Descent Pairs with Prescribed Tops and Bottoms. Electr. J. Comb. 16(1) (2009) - [j104]Sergey Kitaev, Jeffrey Liese, Jeffrey B. Remmel, Bruce E. Sagan:
Rationality, Irrationality, and Wilf Equivalence in Generalized Factor Order. Electr. J. Comb. 16(2) (2009) - [j103]Douglas Cenzer, Geoffrey LaForte, Jeffrey B. Remmel:
Equivalence structures and isomorphisms in the difference hierarchy. J. Symb. Log. 74(2): 535-556 (2009) - [j102]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) - [c40]Douglas A. Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel:
S01 and P01 Equivalence Structures. CiE 2009: 99-108 - [c39]
- [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
- [j101]Howard A. Blair, Victor W. Marek, Jeffrey B. Remmel:
Set based logic programming. Ann. Math. Artif. Intell. 52(1): 81-105 (2008) - [j100]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) - [j99]Anil Nerode, Jeffrey B. Remmel:
Consistency properties and set based logic programming. Ann. Math. Artif. Intell. 53(1-4): 289-311 (2008) - [j98]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) - [j97]Ron M. Adin, Jeffrey B. Remmel, Yuval Roichman:
The Combinatorics of the Garsia-Haiman Modules for Hook Shapes. Electr. J. Comb. 15(1) (2008) - [j96]Brian K. Miceli, Jeffrey B. Remmel:
Augmented Rook Boards and General Product Formulas. Electr. J. Comb. 15(1) (2008) - [j95]Anthony Mendes, Jeffrey B. Remmel:
Descents, inversions, and major indices in permutation groups. Discrete Mathematics 308(12): 2509-2524 (2008) - [j94]Sergey Kitaev, Toufik Mansour, Jeffrey B. Remmel:
Counting Descents, Rises, and Levels, with Prescribed First Element, in Words. Discrete Mathematics & Theoretical Computer Science 10(3) (2008) - [j93]John T. Hall, Jeffrey B. Remmel:
Counting descent pairs with prescribed tops and bottoms. J. Comb. Theory, Ser. A 115(5): 693-725 (2008) - [c38]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 - [c37]Douglas Cenzer, Jeffrey B. Remmel:
A Connection between Cantor-Bendixson Derivatives and the Well-Founded Semantics of Logic Programs. ISAIM 2008 - [c36]
- [c35]
- 2007
- [j92]Paul Brodhead, Douglas Cenzer, Jeffrey B. Remmel:
Random Continuous Functions. Electr. Notes Theor. Comput. Sci. 167: 275-287 (2007) - [j91]Victor W. Marek, Jeffrey B. Remmel:
Compactness Properties for Stable Semantics of Logic Programs. Fundam. Inform. 81(1-3): 211-239 (2007) - [c34]George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber:
K -Trivial Closed Sets and Continuous Functions. CiE 2007: 135-145 - [c33]Victor W. Marek, Jeffrey B. Remmel:
Compactness Properties for Stable Semantics of Logic Programs. LFCS 2007: 379-400 - 2006
- [j90]Sergey Kitaev, Jeffrey B. Remmel:
Classifying Descents According to Equivalence mod k. Electr. J. Comb. 13(1) (2006) - [j89]Andrius Kulikauskas, Jeffrey B. Remmel:
Lyndon Words and Transition Matrices between Elementary, Homogeneous and Monomial Symmetric Functions. Electr. J. Comb. 13(1) (2006) - [j88]Karen S. Briggs, Jeffrey B. Remmel:
m-Rook numbers and a generalization of a formula of Frobenius to Cm Sn. J. Comb. Theory, Ser. A 113(6): 1138-1171 (2006) - [j87]Douglas A. Cenzer, Jeffrey B. Remmel:
Complexity, decidability and completeness. J. Symb. Log. 71(2): 399-424 (2006) - [j86]Douglas A. Cenzer, Jeffrey B. Remmel:
On the complexity of inductive definitions. Mathematical Structures in Computer Science 16(5): 763-788 (2006) - [i4]Alan Nash, Russell Impagliazzo, Jeffrey B. Remmel:
Infinitely-Often Universal Languages and Diagonalization. Electronic Colloquium on Computational Complexity (ECCC) 13(051) (2006) - 2005
- [j85]Douglas A. Cenzer, Jeffrey B. Remmel, Victor W. Marek:
Logic programming with infinite sets. Ann. Math. Artif. Intell. 44(4): 309-339 (2005) - [j84]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]
- [c31]
- [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
- [j83]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) - [j82]T. M. Langley, Jeffrey B. Remmel:
The Plethysm sλ[sμ] at Hook and Near-Hook Shapes. Electr. J. Comb. 11(1) (2004) - [j81]Nicholas A. Loehr, Jeffrey B. Remmel:
Conjectured Combinatorial Models for the Hilbert Series of Generalized Diagonal Harmonics Modules. Electr. J. Comb. 11(1) (2004) - [j80]Anthony Mendes, Jeffrey B. Remmel, Jennifer Wagner:
A lambda-ring Frobenius Characteristic for G wreath Sn. Electr. J. Comb. 11(1) (2004) - [j79]Jeffrey B. Remmel, Michelle L. Wachs:
Rook Theory, Generalized Stirling Numbers and (p, q)-Analogues. Electr. J. Comb. 11(1) (2004) - [j78]James Haglund, Jeffrey B. Remmel:
Cycles and perfect matchings. Discrete Mathematics 274(1-3): 93-108 (2004) - [j77]Ö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) - [j76]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. ISAIM 2004 - [c29]
- [c28]
- [c27]David A. Meyer, James Pommersheim, Jeffrey B. Remmel:
Finding stable models via quantum computation. NMR 2004: 285-291 - 2003
- [j75]Karen S. Briggs, Jeffrey B. Remmel:
A p, q-analogue of a Formula of Frobenius. Electr. J. Comb. 10 (2003) - [j74]Douglas A. Cenzer, Jeffrey B. Remmel:
Index sets for omega-languages. Math. Log. Q. 49(1): 22-33 (2003) - [j73]V. Wiktor Marek, Jeffrey B. Remmel:
On the expressibility of stable logic programming. TPLP 3(4-5): 551-567 (2003) - [c26]Alan Nash, Russell Impagliazzo, Jeffrey B. Remmel:
Universal Languages and the Power of Diagonalization. IEEE Conference on Computational Complexity 2003: 337-346 - [i1]V. Wiktor Marek, Jeffrey B. Remmel:
On the Expressibility of Stable Logic Programming. CoRR cs.AI/0312053 (2003) - 2002
- [j72]Jeffrey B. Remmel, S. G. Williamson:
Spanning Trees and Function Classes. Electr. J. Comb. 9(1) (2002) - [j71]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
- [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. AMAI 2000
1990 – 1999
- 1999
- [j70]V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
Logic Programs, Well-Orderings, and Forward Chaining. Ann. Pure Appl. Logic 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]
- [j66]Douglas A. Cenzer, Jeffrey B. Remmel:
Index Sets for Pi01 Classes. Ann. Pure Appl. Logic 93(1-3): 3-61 (1998) - [j65]Douglas A. Cenzer, Jeffrey B. Remmel:
Feasible Graphs with Standard Universe. Ann. Pure Appl. Logic 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)]. Discrete Mathematics 193(1-3): 147-177 (1998) - [j63]Jeffrey B. Remmel, Mark Shimozono:
A simple proof of the Littlewood-Richardson rule and applications. Discrete Mathematics 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]
- 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. Logic 86(3): 203-218 (1997) - [j58]V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
Complexity of Recursive Normal Default Logic. Fundam. Inform. 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) - [c20]Wolf Kohn, Anil Nerode, Jeffrey B. Remmel:
Scalble Data and Sensor Fusion via Multiple Agent Hybrid Systems. Hybrid Systems 1997: 122-141 - [c19]
- [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
- [j56]Anil Nerode, Jeffrey B. Remmel, Alexander Yakhnis:
McNaughton Games and Extracting Strategies for Concurrent Programs. Ann. Pure Appl. Logic 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. Logic 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. Discrete Mathematics 153(1-3): 3-27 (1996) - [j53]Arun Ram, Jeffrey B. Remmel, Tamsen Whitehead:
Combinatorics of theq-Basis of Symmetric Functions. J. Comb. Theory, Ser. A 76(2): 231-271 (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]
- [c13]Jeffrey B. Remmel:
Nonmonotonic Rule Systems: Foward Chaining, Constraints, and Complexity (Abstract). MFCS 1996: 113 - 1995
- [j52]