The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jeffrey B. Remmel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
    The Stable Models of a Predicate Logic Program. [Citation Graph (1, 0)][DBLP]
    JICSLP, 1992, pp:446-460 [Conf]
  2. V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
    A Theory of Nonmonotonic Rule Systems [Citation Graph (1, 0)][DBLP]
    LICS, 1990, pp:79-94 [Conf]
  3. Douglas A. Cenzer, V. Wiktor Marek, Jeffrey B. Remmel
    Using Logic Programs to Reason about Infinite Sets. [Citation Graph (0, 0)][DBLP]
    AMAI, 2004, pp:- [Conf]
  4. Douglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt
    Characterizing the Set of Extensions of a Nonmonotonic Rule System with Levels. [Citation Graph (0, 0)][DBLP]
    AMAI, 2000, pp:- [Conf]
  5. Victor W. Marek, Jeffrey B. Remmel
    On the Foundations of Answer Set Programming. [Citation Graph (0, 0)][DBLP]
    Answer Set Programming, 2001, pp:- [Conf]
  6. Douglas A. Cenzer, Jeffrey B. Remmel
    The Complexity of Inductive Definability. [Citation Graph (0, 0)][DBLP]
    CiE, 2005, pp:75-85 [Conf]
  7. Alan Nash, Russell Impagliazzo, Jeffrey B. Remmel
    Universal Languages and the Power of Diagonalization. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:337-346 [Conf]
  8. Victor W. Marek, Jeffrey B. Remmel
    Normal Form Theorem for Logic Programs with Cardinality Constraints. [Citation Graph (0, 0)][DBLP]
    Nonmonotonic Reasoning, Answer Set Programming and Constraints, 2005, pp:- [Conf]
  9. Jeffrey B. Remmel, Victor W. Marek
    Set Based Logic Programming. [Citation Graph (0, 0)][DBLP]
    Nonmonotonic Reasoning, Answer Set Programming and Constraints, 2005, pp:- [Conf]
  10. Xiaolin Ge, Wolf Kohn, Anil Nerode, Jeffrey B. Remmel
    Hybrid Systems: Chattering Approximation to Relaxed Controls. [Citation Graph (0, 0)][DBLP]
    Hybrid Systems, 1995, pp:76-100 [Conf]
  11. Wolf Kohn, Anil Nerode, Jeffrey B. Remmel
    Hybrid Systems as Finsler Manifolds: Finite State Control as Approximation to Connections. [Citation Graph (0, 0)][DBLP]
    Hybrid Systems, 1994, pp:294-321 [Conf]
  12. Wolf Kohn, Anil Nerode, Jeffrey B. Remmel
    Agent Based Velocity Control of Highway Systems. [Citation Graph (0, 0)][DBLP]
    Hybrid Systems, 1996, pp:174-214 [Conf]
  13. Wolf Kohn, Anil Nerode, Jeffrey B. Remmel
    Scalble Data and Sensor Fusion via Multiple Agent Hybrid Systems. [Citation Graph (0, 0)][DBLP]
    Hybrid Systems, 1997, pp:122-141 [Conf]
  14. Wolf Kohn, Jeffrey B. Remmel
    Hybrid Dynamic Programming. [Citation Graph (0, 0)][DBLP]
    HART, 1997, pp:391-396 [Conf]
  15. Anil Nerode, Jeffrey B. Remmel, Alexander Yakhnis
    Controllers as Fixed Points of Set-Valued Operators. [Citation Graph (0, 0)][DBLP]
    Hybrid Systems, 1994, pp:344-358 [Conf]
  16. Anil Nerode, Jeffrey B. Remmel, Alexander Yakhnis
    Hybrid System Games: Extraction of Control Automata with Small Topologies. [Citation Graph (0, 0)][DBLP]
    Hybrid Systems, 1996, pp:248-293 [Conf]
  17. Alan Nash, Jeffrey B. Remmel, Victor Vianu
    PTIME Queries Revisited. [Citation Graph (0, 0)][DBLP]
    ICDT, 2005, pp:274-288 [Conf]
  18. V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
    Rule Systems and Well-Orderings. [Citation Graph (0, 0)][DBLP]
    Structural Complexity and Recursion-theoretic methods in Logic-Programming, 1992, pp:69-92 [Conf]
  19. Douglas A. Cenzer, Jeffrey B. Remmel
    Feasibly Categorial Models. [Citation Graph (0, 0)][DBLP]
    LCC, 1994, pp:300-312 [Conf]
  20. V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
    Basic Forward Chaining Construction for Logic Programs. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:214-225 [Conf]
  21. V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
    Complexity of Normal Default Logic and Related Modes of Nonmonotonic Reasoning [Citation Graph (0, 0)][DBLP]
    LICS, 1995, pp:178-185 [Conf]
  22. V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
    On the Complexity of Abduction. [Citation Graph (0, 0)][DBLP]
    LICS, 1996, pp:513-522 [Conf]
  23. Anil Nerode, Jeffrey B. Remmel, Andre Scedrov
    Polynomially Grade Logic I: A Graded Version of System T [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:375-385 [Conf]
  24. Douglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt
    Locally Determined Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1999, pp:34-48 [Conf]
  25. V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
    On Logical Constraints in Logic Programming. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1995, pp:43-56 [Conf]
  26. V. Wiktor Marek, Jeffrey B. Remmel
    On the Expressibility of Stable Logic Programming. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2001, pp:107-120 [Conf]
  27. V. Wiktor Marek, Jeffrey B. Remmel
    Set Constraints in Logic Programming. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2004, pp:167-179 [Conf]
  28. Ch. Pollet, Jeffrey B. Remmel
    Non-Monotonic Reasoning with Quantified Boolean Constraints. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1997, pp:18-39 [Conf]
  29. Jeffrey B. Remmel
    Nonmonotonic Rule Systems: Foward Chaining, Constraints, and Complexity (Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1996, pp:113- [Conf]
  30. Victor W. Marek, Jeffrey B. Remmel
    On logic programs with cardinality constraints. [Citation Graph (0, 0)][DBLP]
    NMR, 2002, pp:219-228 [Conf]
  31. Victor W. Marek, Jeffrey B. Remmel
    Answer set programming with default logic. [Citation Graph (0, 0)][DBLP]
    NMR, 2004, pp:276-284 [Conf]
  32. David A. Meyer, James Pommersheim, Jeffrey B. Remmel
    Finding stable models via quantum computation. [Citation Graph (0, 0)][DBLP]
    NMR, 2004, pp:285-291 [Conf]
  33. Douglas A. Cenzer, Jeffrey B. Remmel, Victor W. Marek
    Logic programming with infinite sets. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:44, n:4, pp:309-339 [Journal]
  34. Douglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt
    Locally Determined Logic Programs and Recursive Stable Models. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2004, v:40, n:3-4, pp:225-262 [Journal]
  35. V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
    A Theory of Nonmonotonic Rule Systems I. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1990, v:1, n:, pp:- [Journal]
  36. V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
    A Theory of Nonmonotonic Rule Systems II. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1992, v:5, n:2-4, pp:229-263 [Journal]
  37. Christopher J. Ash, Julia F. Knight, Jeffrey B. Remmel
    Quasi-Simple Relations in Copies of a Given Recursive Structure. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1997, v:86, n:3, pp:203-218 [Journal]
  38. Frank A. Bäuerle, Jeffrey B. Remmel
    On Speedable and Levelable Vector Spaces. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1994, v:67, n:1-3, pp:61-112 [Journal]
  39. Douglas A. Cenzer, Jeffrey B. Remmel
    Polynomial-Time versus Recursive Models. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1991, v:54, n:1, pp:17-58 [Journal]
  40. Douglas A. Cenzer, Jeffrey B. Remmel
    Polynomial-Time Abelian Groups. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1992, v:56, n:1-3, pp:313-363 [Journal]
  41. Douglas A. Cenzer, Jeffrey B. Remmel
    Feasible Graphs with Standard Universe. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:21-35 [Journal]
  42. Douglas A. Cenzer, Jeffrey B. Remmel
    Preface. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:93, n:1-3, pp:1-2 [Journal]
  43. Douglas A. Cenzer, Jeffrey B. Remmel
    Index Sets for Pi01 Classes. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:93, n:1-3, pp:3-61 [Journal]
  44. John N. Crossley, Jeffrey B. Remmel
    Cancellation Laws for Polynomial-Time p-Isolated Sets. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1992, v:56, n:1-3, pp:147-172 [Journal]
  45. Rodney G. Downey, Jeffrey B. Remmel
    Classification of Degree Classes Associated with r.e. Subspaces. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1989, v:42, n:2, pp:105-124 [Journal]
  46. V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
    A Context for Belief Revision: Forward Chaining - Normal Nonmonotonic Rule Systems. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1994, v:67, n:1-3, pp:269-323 [Journal]
  47. V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
    Logic Programs, Well-Orderings, and Forward Chaining. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1999, v:96, n:1-3, pp:231-276 [Journal]
  48. V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
    How Complicated is the Set of Stable Models of a Recursive Logic Program? [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1992, v:56, n:1-3, pp:119-135 [Journal]
  49. Anil Nerode, Jeffrey B. Remmel
    Complexity-Theoretic Algebra II: Boolean Algebras. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1989, v:44, n:1-2, pp:71-99 [Journal]
  50. Anil Nerode, Jeffrey B. Remmel
    On the Lattices of NP-Subspaces of a Polynomial Time Vector Space over a Finite Field. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1996, v:81, n:1-3, pp:125-170 [Journal]
  51. Anil Nerode, Jeffrey B. Remmel, Alexander Yakhnis
    McNaughton Games and Extracting Strategies for Concurrent Programs. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1996, v:78, n:1-3, pp:203-242 [Journal]
  52. Karen S. Briggs, Jeffrey B. Remmel
    A p, q-analogue of a Formula of Frobenius. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  53. T. M. Langley, Jeffrey B. Remmel
    The Plethysm s?[s?] at Hook and Near-Hook Shapes. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal]
  54. Nicholas A. Loehr, Jeffrey B. Remmel
    Conjectured Combinatorial Models for the Hilbert Series of Generalized Diagonal Harmonics Modules. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal]
  55. Anthony Mendes, Jeffrey B. Remmel, Jennifer Wagner
    A lambda-ring Frobenius Characteristic for G wreath Sn. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal]
  56. Jeffrey B. Remmel, S. G. Williamson
    Spanning Trees and Function Classes. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:9, n:1, pp:- [Journal]
  57. V. Wiktor Marek, Jeffrey B. Remmel
    On the Expressibility of Stable Logic Programming [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  58. James Haglund, Jeffrey B. Remmel
    Cycles and perfect matchings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:274, n:1-3, pp:93-108 [Journal]
  59. James Haglund, Nicholas A. Loehr, Jeffrey B. Remmel
    Statistics on wreath products, perfect matchings, and signed words. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:6, pp:835-868 [Journal]
  60. Mei Yang, Jeffrey B. Remmel
    Hook-Schur Functions Analogues of Littlewood's Identities and their Bijective Proofs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1998, v:19, n:2, pp:257-272 [Journal]
  61. Paul Brodhead, Douglas Cenzer, Jeffrey B. Remmel
    Random Continuous Functions. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:167, n:, pp:275-287 [Journal]
  62. V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
    Complexity of Recursive Normal Default Logic. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:32, n:2, pp:139-147 [Journal]
  63. Douglas A. Cenzer, Jeffrey B. Remmel
    Complexity and Categoricity. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:140, n:1, pp:2-25 [Journal]
  64. Ömer Egecioglu, Jeffrey B. Remmel, S. G. Williamson
    A Class Of Graphs Which Has Efficient Ranking And Unranking Algorithms For Spanning Trees And Forests. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2004, v:15, n:4, pp:619-648 [Journal]
  65. Jeffrey B. Remmel, Roger Whitney
    Multiplying Schur functions. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1984, v:5, n:4, pp:471-487 [Journal]
  66. Desiree A. Beck, Jeffrey B. Remmel
    Permutation Enumeration of the Symmetric Group and the Combinatorics of Symmetric Functions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1995, v:72, n:1, pp:1-49 [Journal]
  67. Joaquin O. Carbonara, Jeffrey B. Remmel, Andrius Kulikauskas
    A Combinatorial Proof of the Equivalence of the Classical and Combinatorial Definitions of Schur Function. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1995, v:72, n:2, pp:293-301 [Journal]
  68. Ömer Egecioglu, Jeffrey B. Remmel
    The monomial symmetric functions and the Frobenius map. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1990, v:54, n:2, pp:272-295 [Journal]
  69. Ömer Egecioglu, Jeffrey B. Remmel
    Bijections for Cayley trees, spanning trees, and their q-analogues. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:42, n:1, pp:15-30 [Journal]
  70. Adriano M. Garsia, Jeffrey B. Remmel
    Q-counting rook configurations and a formula of frobenius. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:41, n:2, pp:246-275 [Journal]
  71. Arun Ram, Jeffrey B. Remmel, Tamsen Whitehead
    Combinatorics of theq-Basis of Symmetric Functions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:76, n:2, pp:231-271 [Journal]
  72. Jeffrey B. Remmel
    Bijective Proofs of Some Classical Partition Identities. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1982, v:33, n:3, pp:273-286 [Journal]
  73. Karen S. Briggs, Jeffrey B. Remmel
    m-Rook numbers and a generalization of a formula of Frobenius to Cm Sn. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2006, v:113, n:6, pp:1138-1171 [Journal]
  74. V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
    The Stable Models of a Predicate Logic Program. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1994, v:21, n:3, pp:129-153 [Journal]
  75. Rodney G. Downey, Jeffrey B. Remmel
    The Universal Complementation Property. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1984, v:49, n:4, pp:1125-1136 [Journal]
  76. Carl G. Jockusch Jr., A. Lewis, Jeffrey B. Remmel
    Pi01-Classes and Rado's Selection Principle. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1991, v:56, n:2, pp:684-693 [Journal]
  77. Iraj Kalantari, Jeffrey B. Remmel
    Degrees of Recursively Enumerable Topological Spaces. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1983, v:48, n:3, pp:610-622 [Journal]
  78. Henry A. Kierstead, Jeffrey B. Remmel
    Indiscernibles and Decidable Models. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1983, v:48, n:1, pp:21-32 [Journal]
  79. Manuel Lerman, Jeffrey B. Remmel
    The Universal Splitting Property. II. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1984, v:49, n:1, pp:137-150 [Journal]
  80. Alfred B. Manaster, Jeffrey B. Remmel
    Partial Orderings of Fixed Finite Dimension: Model Companions and Density. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1981, v:46, n:4, pp:789-802 [Journal]
  81. G. Metakides, Jeffrey B. Remmel
    Recursion Theory on Orderings. I. A Model Theoretic Setting. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1979, v:44, n:3, pp:383-402 [Journal]
  82. D. Miller, Jeffrey B. Remmel
    Effectively Nowhere Simple Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1984, v:49, n:1, pp:129-136 [Journal]
  83. Jeffrey B. Remmel
    Co-Hypersimple Structures. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:3, pp:611-625 [Journal]
  84. Jeffrey B. Remmel
    Maximal and Cohesive Vector Spaces. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1977, v:42, n:3, pp:400-418 [Journal]
  85. Jeffrey B. Remmel
    A r-Maximal Vector Space not contained in any Maximal Vector Space. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1978, v:43, n:3, pp:430-441 [Journal]
  86. Jeffrey B. Remmel
    R-Maximal Boolean Algebras. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1979, v:44, n:4, pp:533-548 [Journal]
  87. Jeffrey B. Remmel
    On R.E. and CO-R.E. Vector Spaces with Nonextendible Bases. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1980, v:45, n:1, pp:20-34 [Journal]
  88. Jeffrey B. Remmel
    Recursion Theory on Orderings. II. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1980, v:45, n:2, pp:317-333 [Journal]
  89. Jeffrey B. Remmel
    Recursive Isomorphism Types of Recursive Boolean Algebras. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1981, v:46, n:3, pp:572-594 [Journal]
  90. Jeffrey B. Remmel
    Recursive Boolean Algebras with Recursive Atoms. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1981, v:46, n:3, pp:595-616 [Journal]
  91. Douglas A. Cenzer, Jeffrey B. Remmel
    Index sets for omega-languages. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2003, v:49, n:1, pp:22-33 [Journal]
  92. Jeffrey B. Remmel, Douglas A. Cenzer
    Feasible Graphs and Colorings. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1995, v:41, n:, pp:327-352 [Journal]
  93. Douglas Cenzer, Jeffrey B. Remmel
    Index sets for computable differential equations. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2004, v:50, n:4-5, pp:329-344 [Journal]
  94. Jeffrey B. Remmel, Mei Yang
    Special Rim Hook Tabloids and Some New Multiplicity-Free S-Series. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:2, pp:253-274 [Journal]
  95. Douglas A. Cenzer, Jeffrey B. Remmel
    Effectively closed sets and graphs of computable real functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:284, n:2, pp:279-318 [Journal]
  96. Douglas A. Cenzer, Jeffrey B. Remmel
    Index Sets in Computable Analysis. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:219, n:1-2, pp:111-150 [Journal]
  97. Wolf Kohn, Anil Nerode, Jeffrey B. Remmel, Alexander Yakhnis
    Viability in Hybrid Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:138, n:1, pp:141-168 [Journal]
  98. Anil Nerode, Jeffrey B. Remmel, V. S. Subrahmanian
    Annotated Nonmonotonic Rule Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:171, n:1-2, pp:111-146 [Journal]
  99. V. Wiktor Marek, Jeffrey B. Remmel
    On the expressibility of stable logic programming. [Citation Graph (0, 0)][DBLP]
    TPLP, 2003, v:3, n:4-5, pp:551-567 [Journal]
  100. George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber
    K -Trivial Closed Sets and Continuous Functions. [Citation Graph (0, 0)][DBLP]
    CiE, 2007, pp:135-145 [Conf]
  101. Victor W. Marek, Jeffrey B. Remmel
    Compactness Properties for Stable Semantics of Logic Programs. [Citation Graph (0, 0)][DBLP]
    LFCS, 2007, pp:379-400 [Conf]
  102. Jeffrey B. Remmel
    Permutation statistics and (k, l)-hook Schur functions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:67, n:3, pp:271-298 [Journal]
  103. Luisa Carini, Jeffrey B. Remmel
    Formulas for the expansion of the plethysms s2[S(a, b)] and S2[S(nk)]. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:193, n:1-3, pp:147-177 [Journal]
  104. Jeffrey B. Remmel, Mark Shimozono
    A simple proof of the Littlewood-Richardson rule and applications. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:193, n:1-3, pp:257-266 [Journal]
  105. 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). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:99, n:1-3, pp:265-287 [Journal]
  106. Desiree A. Beck, Jeffrey B. Remmel, Tamsen Whitehead
    The combinatorics of transition matrices between the bases of the symmetric functions and the Bn analogues. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:153, n:1-3, pp:3-27 [Journal]

  107. S01 and P01 Equivalence Structures. [Citation Graph (, )][DBLP]


  108. On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP. [Citation Graph (, )][DBLP]


  109. Automata and Answer Set Programming. [Citation Graph (, )][DBLP]


  110. The chase revisited. [Citation Graph (, )][DBLP]


  111. Consistency properties and set based logic programming. [Citation Graph (, )][DBLP]


  112. Set based logic programming. [Citation Graph (, )][DBLP]


  113. My work with Victor Marek: a mathematician looks at answer set programming. [Citation Graph (, )][DBLP]


  114. Algorithmic randomness of continuous functions. [Citation Graph (, )][DBLP]


  115. Nonmonotonic rule systems with recursive sets of restraints. [Citation Graph (, )][DBLP]


  116. Space complexity of Abelian groups. [Citation Graph (, )][DBLP]


  117. The complexity of recursive constraint satisfaction problems. [Citation Graph (, )][DBLP]


  118. Classifying Descents According to Equivalence mod k. [Citation Graph (, )][DBLP]


  119. Lyndon Words and Transition Matrices between Elementary, Homogeneous and Monomial Symmetric Functions. [Citation Graph (, )][DBLP]


  120. Guarded resolution for answer set programming [Citation Graph (, )][DBLP]


  121. An Application of Proof-Theory in answer Set Programming [Citation Graph (, )][DBLP]


  122. Brick tabloids and the connection matrices between bases of symmetric functions. [Citation Graph (, )][DBLP]


  123. Descents, inversions, and major indices in permutation groups. [Citation Graph (, )][DBLP]


  124. Counting Descents, Rises, and Levels, with Prescribed First Element, in Words. [Citation Graph (, )][DBLP]


  125. Infinitely-Often Universal Languages and Diagonalization. [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.014secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002