Jeffrey B. Remmel

	2012
151		Alex Brik, Jeffrey B. Remmel: Expressing Preferences using Preference Set Constraint Atoms CoRR abs/1203.0587: (2012)
	2011
150		Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel: Effective Categoricity of Injection Structures. CiE 2011: 51-60
149		Alex Brik, Jeffrey B. Remmel: Hybrid ASP. ICLP (Technical Communications) 2011: 40-50
148		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
147		Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel: Σ01 and Π01 equivalence structures. Ann. Pure Appl. Logic 162(7): 490-503 (2011)
146		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)
145		Evan Fuller, Jeffrey B. Remmel: Quasi-symmetric functions and up-down compositions. Discrete Mathematics 311(16): 1754-1767 (2011)
144		Adrian Duane, Jeffrey B. Remmel: Minimal Overlapping Patterns in Colored Permutations. Electr. J. Comb. 18(2): (2011)
143		Victor W. Marek, Jeffrey B. Remmel: Guarded resolution for Answer Set Programming. TPLP 11(1): 111-123 (2011)
	2010
142		Jeffrey B. Remmel, Manda Riehl: Generating Functions for Permutations which Contain a Given Descent Set. Electr. J. Comb. 17(1): (2010)
	2009
141		Douglas A. Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel: S01 and P01 Equivalence Structures. CiE 2009: 99-108
140		Victor W. Marek, Jeffrey B. Remmel: Automata and Answer Set Programming. LFCS 2009: 323-337
139		Victor W. Marek, Jeffrey B. Remmel: The complexity of recursive constraint satisfaction problems. Ann. Pure Appl. Logic 161(3): 447-457 (2009)
138		Douglas Cenzer, Rodney G. Downey, Jeffrey B. Remmel, Zia Uddin: Space complexity of Abelian groups. Arch. Math. Log. 48(1): 115-140 (2009)
137		V. Wiktor Marek, Jeffrey B. Remmel: Guarded resolution for answer set programming CoRR abs/0904.3953: (2009)
136		Victor W. Marek, Jeffrey B. Remmel: An Application of Proof-Theory in answer Set Programming CoRR abs/0905.0197: (2009)
135		John T. Hall, Jeffrey Liese, Jeffrey B. Remmel: q-Counting Descent Pairs with Prescribed Tops and Bottoms. Electr. J. Comb. 16(1): (2009)
134		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)
133		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)
132		Douglas Cenzer, Geoffrey LaForte, Jeffrey B. Remmel: Equivalence structures and isomorphisms in the difference hierarchy. J. Symb. Log. 74(2): 535-556 (2009)
	2008
131		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
130		Douglas Cenzer, Jeffrey B. Remmel: A Connection between Cantor-Bendixson Derivatives and the Well-Founded Semantics of Logic Programs. ISAIM 2008
129		Jeffrey B. Remmel: A Mathematician Looks at Answer Set Programming. ISAIM 2008
128		Alin Deutsch, Alan Nash, Jeffrey B. Remmel: The chase revisited. PODS 2008: 149-158
127		Howard A. Blair, Victor W. Marek, Jeffrey B. Remmel: Set based logic programming. Ann. Math. Artif. Intell. 52(1): 81-105 (2008)
126		Anil Nerode, Jeffrey B. Remmel: Consistency properties and set based logic programming. Ann. Math. Artif. Intell. 53(1-4): 289-311 (2008)
125		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)
124		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)
123		Anthony Mendes, Jeffrey B. Remmel: Descents, inversions, and major indices in permutation groups. Discrete Mathematics 308(12): 2509-2524 (2008)
122		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)
121		Brian K. Miceli, Jeffrey B. Remmel: Augmented Rook Boards and General Product Formulas. Electr. J. Comb. 15(1): (2008)
120		Ron M. Adin, Jeffrey B. Remmel, Yuval Roichman: The Combinatorics of the Garsia-Haiman Modules for Hook Shapes. Electr. J. Comb. 15(1): (2008)
119		John T. Hall, Jeffrey B. Remmel: Counting descent pairs with prescribed tops and bottoms. J. Comb. Theory, Ser. A 115(5): 693-725 (2008)
	2007
118		George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber: K -Trivial Closed Sets and Continuous Functions. CiE 2007: 135-145
117		Victor W. Marek, Jeffrey B. Remmel: Compactness Properties for Stable Semantics of Logic Programs. LFCS 2007: 379-400
116		Paul Brodhead, Douglas Cenzer, Jeffrey B. Remmel: Random Continuous Functions. Electr. Notes Theor. Comput. Sci. 167: 275-287 (2007)
115		Victor W. Marek, Jeffrey B. Remmel: Compactness Properties for Stable Semantics of Logic Programs. Fundam. Inform. 81(1-3): 211-239 (2007)
	2006
114		Sergey Kitaev, Jeffrey B. Remmel: Classifying Descents According to Equivalence mod k. Electr. J. Comb. 13(1): (2006)
113		Andrius Kulikauskas, Jeffrey B. Remmel: Lyndon Words and Transition Matrices between Elementary, Homogeneous and Monomial Symmetric Functions. Electr. J. Comb. 13(1): (2006)
112		Alan Nash, Russell Impagliazzo, Jeffrey B. Remmel: Infinitely-Often Universal Languages and Diagonalization. Electronic Colloquium on Computational Complexity (ECCC) 13(051): (2006)
111		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)
110		Douglas A. Cenzer, Jeffrey B. Remmel: Complexity, decidability and completeness. J. Symb. Log. 71(2): 399-424 (2006)
109		Douglas A. Cenzer, Jeffrey B. Remmel: On the complexity of inductive definitions. Mathematical Structures in Computer Science 16(5): 763-788 (2006)
	2005
108		Douglas A. Cenzer, Jeffrey B. Remmel: The Complexity of Inductive Definability. CiE 2005: 75-85
107		Alan Nash, Jeffrey B. Remmel, Victor Vianu: PTIME Queries Revisited. ICDT 2005: 274-288
106		Victor W. Marek, Jeffrey B. Remmel: Normal Form Theorem for Logic Programs with Cardinality Constraints. Nonmonotonic Reasoning, Answer Set Programming and Constraints 2005
105		Jeffrey B. Remmel, Victor W. Marek: Set Based Logic Programming. Nonmonotonic Reasoning, Answer Set Programming and Constraints 2005
104		Douglas A. Cenzer, Jeffrey B. Remmel, Victor W. Marek: Logic programming with infinite sets. Ann. Math. Artif. Intell. 44(4): 309-339 (2005)
103		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
102		Douglas A. Cenzer, V. Wiktor Marek, Jeffrey B. Remmel: Using Logic Programs to Reason about Infinite Sets. AMAI 2004
101		Douglas Cenzer, V. Wiktor Marek, Jeffrey B. Remmel: Using Logic Programs to Reason about Infinite Sets. ISAIM 2004
100		V. Wiktor Marek, Jeffrey B. Remmel: Set Constraints in Logic Programming. LPNMR 2004: 167-179
99		Victor W. Marek, Jeffrey B. Remmel: Answer set programming with default logic. NMR 2004: 276-284
98		David A. Meyer, James Pommersheim, Jeffrey B. Remmel: Finding stable models via quantum computation. NMR 2004: 285-291
97		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)
96		James Haglund, Jeffrey B. Remmel: Cycles and perfect matchings. Discrete Mathematics 274(1-3): 93-108 (2004)
95		Anthony Mendes, Jeffrey B. Remmel, Jennifer Wagner: A lambda-ring Frobenius Characteristic for G wreath Sn. Electr. J. Comb. 11(1): (2004)
94		Nicholas A. Loehr, Jeffrey B. Remmel: Conjectured Combinatorial Models for the Hilbert Series of Generalized Diagonal Harmonics Modules. Electr. J. Comb. 11(1): (2004)
93		Jeffrey B. Remmel, Michelle L. Wachs: Rook Theory, Generalized Stirling Numbers and (p, q)-Analogues. Electr. J. Comb. 11(1): (2004)
92		T. M. Langley, Jeffrey B. Remmel: The Plethysm sλ[sμ] at Hook and Near-Hook Shapes. Electr. J. Comb. 11(1): (2004)
91		Ö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)
90		Douglas Cenzer, Jeffrey B. Remmel: Index sets for computable differential equations. Math. Log. Q. 50(4-5): 329-344 (2004)
	2003
89		Alan Nash, Russell Impagliazzo, Jeffrey B. Remmel: Universal Languages and the Power of Diagonalization. IEEE Conference on Computational Complexity 2003: 337-346
88		V. Wiktor Marek, Jeffrey B. Remmel: On the Expressibility of Stable Logic Programming CoRR cs.AI/0312053: (2003)
87		Karen S. Briggs, Jeffrey B. Remmel: A p, q-analogue of a Formula of Frobenius. Electr. J. Comb. 10: (2003)
86		Douglas A. Cenzer, Jeffrey B. Remmel: Index sets for omega-languages. Math. Log. Q. 49(1): 22-33 (2003)
85		V. Wiktor Marek, Jeffrey B. Remmel: On the expressibility of stable logic programming. TPLP 3(4-5): 551-567 (2003)
	2002
84		Victor W. Marek, Jeffrey B. Remmel: On logic programs with cardinality constraints. NMR 2002: 219-228
83		Jeffrey B. Remmel, S. G. Williamson: Spanning Trees and Function Classes. Electr. J. Comb. 9(1): (2002)
82		Douglas A. Cenzer, Jeffrey B. Remmel: Effectively closed sets and graphs of computable real functions. Theor. Comput. Sci. 284(2): 279-318 (2002)
	2001
81		Victor W. Marek, Jeffrey B. Remmel: On the Foundations of Answer Set Programming. Answer Set Programming 2001
80		V. Wiktor Marek, Jeffrey B. Remmel: On the Expressibility of Stable Logic Programming. LPNMR 2001: 107-120
	2000
79		Douglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt: Characterizing the Set of Extensions of a Nonmonotonic Rule System with Levels. AMAI 2000
	1999
78		Douglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt: Locally Determined Logic Programs. LPNMR 1999: 34-48
77		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)
76		Douglas A. Cenzer, Jeffrey B. Remmel: Index Sets in Computable Analysis. Theor. Comput. Sci. 219(1-2): 111-150 (1999)
	1998
75		Douglas A. Cenzer, Jeffrey B. Remmel: Preface. Ann. Pure Appl. Logic 93(1-3): 1-2 (1998)
74		Douglas A. Cenzer, Jeffrey B. Remmel: Index Sets for Pi01 Classes. Ann. Pure Appl. Logic 93(1-3): 3-61 (1998)
73		Douglas A. Cenzer, Jeffrey B. Remmel: Feasible Graphs with Standard Universe. Ann. Pure Appl. Logic 94(1-3): 21-35 (1998)
72		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)
71		Jeffrey B. Remmel, Mark Shimozono: A simple proof of the Littlewood-Richardson rule and applications. Discrete Mathematics 193(1-3): 257-266 (1998)
70		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)
69		Douglas A. Cenzer, Jeffrey B. Remmel: Complexity and Categoricity. Inf. Comput. 140(1): 2-25 (1998)
	1997
68		Wolf Kohn, Jeffrey B. Remmel: Hybrid Dynamic Programming. HART 1997: 391-396
67		Wolf Kohn, Anil Nerode, Jeffrey B. Remmel: Scalble Data and Sensor Fusion via Multiple Agent Hybrid Systems. Hybrid Systems 1997: 122-141
66		V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel: Basic Forward Chaining Construction for Logic Programs. LFCS 1997: 214-225
65		Ch. Pollet, Jeffrey B. Remmel: Non-Monotonic Reasoning with Quantified Boolean Constraints. LPNMR 1997: 18-39
64		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)
63		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)
62		V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel: Complexity of Recursive Normal Default Logic. Fundam. Inform. 32(2): 139-147 (1997)
61		Anil Nerode, Jeffrey B. Remmel, V. S. Subrahmanian: Annotated Nonmonotonic Rule Systems. Theor. Comput. Sci. 171(1-2): 111-146 (1997)
	1996
60		Wolf Kohn, Anil Nerode, Jeffrey B. Remmel: Agent Based Velocity Control of Highway Systems. Hybrid Systems 1996: 174-214
59		Anil Nerode, Jeffrey B. Remmel, Alexander Yakhnis: Hybrid System Games: Extraction of Control Automata with Small Topologies. Hybrid Systems 1996: 248-293
58		V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel: On the Complexity of Abduction. LICS 1996: 513-522
57		Jeffrey B. Remmel: Nonmonotonic Rule Systems: Foward Chaining, Constraints, and Complexity (Abstract). MFCS 1996: 113
56		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)
55		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)
54		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)
53		Arun Ram, Jeffrey B. Remmel, Tamsen Whitehead: Combinatorics of theq-Basis of Symmetric Functions. J. Comb. Theory, Ser. A 76(2): 231-271 (1996)
	1995
52		Xiaolin Ge, Wolf Kohn, Anil Nerode, Jeffrey B. Remmel: Hybrid Systems: Chattering Approximation to Relaxed Controls. Hybrid Systems 1995: 76-100
51		V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel: Complexity of Normal Default Logic and Related Modes of Nonmonotonic Reasoning LICS 1995: 178-185
50		V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel: On Logical Constraints in Logic Programming. LPNMR 1995: 43-56
49		Desiree A. Beck, Jeffrey B. Remmel: Permutation Enumeration of the Symmetric Group and the Combinatorics of Symmetric Functions. J. Comb. Theory, Ser. A 72(1): 1-49 (1995)
48		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, Ser. A 72(2): 293-301 (1995)
47		Jeffrey B. Remmel, Douglas A. Cenzer: Feasible Graphs and Colorings. Math. Log. Q. 41: 327-352 (1995)
46		Wolf Kohn, Anil Nerode, Jeffrey B. Remmel, Alexander Yakhnis: Viability in Hybrid Systems. Theor. Comput. Sci. 138(1): 141-168 (1995)
	1994
45		Wolf Kohn, Anil Nerode, Jeffrey B. Remmel: Hybrid Systems as Finsler Manifolds: Finite State Control as Approximation to Connections. Hybrid Systems 1994: 294-321
44		Anil Nerode, Jeffrey B. Remmel, Alexander Yakhnis: Controllers as Fixed Points of Set-Valued Operators. Hybrid Systems 1994: 344-358
43		Douglas A. Cenzer, Jeffrey B. Remmel: Feasibly Categorial Models. LCC 1994: 300-312
42		V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel: A Context for Belief Revision: Forward Chaining - Normal Nonmonotonic Rule Systems. Ann. Pure Appl. Logic 67(1-3): 269-323 (1994)
41		Frank A. Bäuerle, Jeffrey B. Remmel: On Speedable and Levelable Vector Spaces. Ann. Pure Appl. Logic 67(1-3): 61-112 (1994)
40		V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel: The Stable Models of a Predicate Logic Program. J. Log. Program. 21(3): 129-153 (1994)
39		John N. Crossley, Jeffrey B. Remmel: Proofs, programs, and run times. Meth. of Logic in CS 1(2): 183-215 (1994)
	1992
38		V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel: The Stable Models of a Predicate Logic Program. JICSLP 1992: 446-460
37		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
36		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)
35		V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel: How Complicated is the Set of Stable Models of a Recursive Logic Program? Ann. Pure Appl. Logic 56(1-3): 119-135 (1992)
34		John N. Crossley, Jeffrey B. Remmel: Cancellation Laws for Polynomial-Time p-Isolated Sets. Ann. Pure Appl. Logic 56(1-3): 147-172 (1992)
33		Douglas A. Cenzer, Jeffrey B. Remmel: Polynomial-Time Abelian Groups. Ann. Pure Appl. Logic 56(1-3): 313-363 (1992)
32		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). Discrete Mathematics 99(1-3): 265-287 (1992)
	1991
31		Douglas A. Cenzer, Jeffrey B. Remmel: Polynomial-Time versus Recursive Models. Ann. Pure Appl. Logic 54(1): 17-58 (1991)
30		Ömer Egecioglu, Jeffrey B. Remmel: Brick tabloids and the connection matrices between bases of symmetric functions. Discrete Applied Mathematics 34(1-3): 107-120 (1991)
29		Carl G. Jockusch Jr., A. Lewis, Jeffrey B. Remmel: Pi01-Classes and Rado's Selection Principle. J. Symb. Log. 56(2): 684-693 (1991)
28		Jeffrey B. Remmel, Mei Yang: Special Rim Hook Tabloids and Some New Multiplicity-Free S-Series. SIAM J. Discrete Math. 4(2): 253-274 (1991)
	1990
27		V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel: A Theory of Nonmonotonic Rule Systems LICS 1990: 79-94
26		V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel: A Theory of Nonmonotonic Rule Systems I. Ann. Math. Artif. Intell. 1: 241-273 (1990)
25		Ömer Egecioglu, Jeffrey B. Remmel: The monomial symmetric functions and the Frobenius map. J. Comb. Theory, Ser. A 54(2): 272-295 (1990)
	1989
24		Anil Nerode, Jeffrey B. Remmel, Andre Scedrov: Polynomially Grade Logic I: A Graded Version of System T LICS 1989: 375-385
23		Rodney G. Downey, Jeffrey B. Remmel: Classification of Degree Classes Associated with r.e. Subspaces. Ann. Pure Appl. Logic 42(2): 105-124 (1989)
22		Anil Nerode, Jeffrey B. Remmel: Complexity-Theoretic Algebra II: Boolean Algebras. Ann. Pure Appl. Logic 44(1-2): 71-99 (1989)
	1987
21		Jeffrey B. Remmel: Permutation statistics and (k, l)-hook Schur functions. Discrete Mathematics 67(3): 271-298 (1987)
	1986
20		Adriano M. Garsia, Jeffrey B. Remmel: Q-counting rook configurations and a formula of frobenius. J. Comb. Theory, Ser. A 41(2): 246-275 (1986)
19		Ömer Egecioglu, Jeffrey B. Remmel: Bijections for Cayley trees, spanning trees, and their q-analogues. J. Comb. Theory, Ser. A 42(1): 15-30 (1986)
	1985
18		Adriano M. Garsia, Jeffrey B. Remmel: Shuffles of permutations and the Kronecker product. Graphs and Combinatorics 1(1): 217-263 (1985)
	1984
17		Jeffrey B. Remmel, Roger Whitney: Multiplying Schur functions. J. Algorithms 5(4): 471-487 (1984)
16		D. Miller, Jeffrey B. Remmel: Effectively Nowhere Simple Sets. J. Symb. Log. 49(1): 129-136 (1984)
15		Manuel Lerman, Jeffrey B. Remmel: The Universal Splitting Property. II. J. Symb. Log. 49(1): 137-150 (1984)
14		Rodney G. Downey, Jeffrey B. Remmel: The Universal Complementation Property. J. Symb. Log. 49(4): 1125-1136 (1984)
	1983
13		Henry A. Kierstead, Jeffrey B. Remmel: Indiscernibles and Decidable Models. J. Symb. Log. 48(1): 21-32 (1983)
12		Iraj Kalantari, Jeffrey B. Remmel: Degrees of Recursively Enumerable Topological Spaces. J. Symb. Log. 48(3): 610-622 (1983)
	1982
11		Jeffrey B. Remmel: Bijective Proofs of Some Classical Partition Identities. J. Comb. Theory, Ser. A 33(3): 273-286 (1982)
	1981
10		Jeffrey B. Remmel: Recursive Isomorphism Types of Recursive Boolean Algebras. J. Symb. Log. 46(3): 572-594 (1981)
9		Jeffrey B. Remmel: Recursive Boolean Algebras with Recursive Atoms. J. Symb. Log. 46(3): 595-616 (1981)
8		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
7		Jeffrey B. Remmel: On R.E. and CO-R.E. Vector Spaces with Nonextendible Bases. J. Symb. Log. 45(1): 20-34 (1980)
6		Jeffrey B. Remmel: Recursion Theory on Orderings. II. J. Symb. Log. 45(2): 317-333 (1980)
	1979
5		G. Metakides, Jeffrey B. Remmel: Recursion Theory on Orderings. I. A Model Theoretic Setting. J. Symb. Log. 44(3): 383-402 (1979)
4		Jeffrey B. Remmel: R-Maximal Boolean Algebras. J. Symb. Log. 44(4): 533-548 (1979)
	1978
3		Jeffrey B. Remmel: A r-Maximal Vector Space not contained in any Maximal Vector Space. J. Symb. Log. 43(3): 430-441 (1978)
	1977
2		Jeffrey B. Remmel: Maximal and Cohesive Vector Spaces. J. Symb. Log. 42(3): 400-418 (1977)
	1976
1		Jeffrey B. Remmel: Co-Hypersimple Structures. J. Symb. Log. 41(3): 611-625 (1976)

Coauthor Index

1	Ron M. Adin	[120]
2	Christopher J. Ash	[64]
3	George Barmpalias	[118] [124] [133]
4	Frank A. Bäuerle	[41]
5	Desiree A. Beck	[49] [54]
6	Howard A. Blair	[127]
7	Karen S. Briggs	[87] [111]
8	Alex Brik	[149] [151]
9	Paul Brodhead	[116] [124]
10	Joaquin O. Carbonara	[48]
11	Luisa Carini	[72]
12	Douglas A. Cenzer (Douglas Cenzer)	[31] [33] [43] [47] [69] [73] [74] [75] [76] [78] [79] [82] [86] [90] [97] [101] [102] [104] [108] [109] [110] [116] [118] [124] [130] [132] [133] [138] [141] [147] [150]
13	John N. Crossley	[34] [39]
14	Alin Deutsch	[128]
15	Rodney G. Downey (Rod Downey)	[14] [23] [138]
16	Adrian Duane	[144]
17	Ömer Egecioglu	[19] [25] [30] [91]
18	Evan Fuller	[145]
19	Adriano M. Garsia	[18] [20]
20	Xiaolin Ge	[52]
21	James Haglund	[96] [103]
22	John T. Hall	[119] [135]
23	Valentina S. Harizanov	[141] [147] [150]
24	Russell Impagliazzo	[89] [112]
25	Carl G. Jockusch Jr.	[29]
26	Iraj Kalantari	[12]
27	Hal A. Kierstead (Henry A. Kierstead)	[13]
28	Sergey Kitaev	[114] [122] [134] [146]
29	Julia F. Knight	[64]
30	Wolf Kohn	[45] [46] [52] [60] [67] [68]
31	Andrius Kulikauskas	[48] [113]
32	Geoffrey LaForte	[132]
33	T. M. Langley	[92]
34	Manuel Lerman	[15]
35	A. Lewis	[29]
36	Jeffrey Liese	[134] [135]
37	Nicholas A. Loehr	[94] [103]
38	Alfred B. Manaster	[8]
39	Toufik Mansour	[122]
40	Victor W. Marek (V. Wiktor Marek)	[26] [27] [35] [36] [37] [38] [40] [42] [50] [51] [58] [62] [63] [66] [77] [80] [81] [84] [85] [88] [99] [100] [101] [102] [104] [105] [106] [115] [117] [127] [131] [136] [137] [139] [140] [143] [148]
41	Anthony Mendes	[95] [123]
42	G. Metakides	[5]
43	David A. Meyer	[98]
44	Brian K. Miceli	[121]
45	D. Miller	[16]
46	Alan Nash	[89] [107] [112] [128]
47	Anil Nerode	[22] [24] [26] [27] [35] [36] [37] [38] [40] [42] [44] [45] [46] [50] [51] [52] [55] [56] [58] [59] [60] [61] [62] [63] [66] [67] [77] [126]
48	Ch. Pollet	[65]
49	James Pommersheim	[98]
50	Arun Ram	[53]
51	Manda Riehl	[142]
52	Yuval Roichman	[120]
53	Bruce E. Sagan	[134]
54	Andre Scedrov	[24]
55	Mark Shimozono	[71]
56	V. S. Subrahmanian	[61]
57	Zia Uddin	[138]
58	Amy Vanderbilt	[78] [79] [97]
59	Victor Vianu	[107]
60	Michelle L. Wachs	[93]
61	Jennifer Wagner	[95]
62	Rebecca Weber	[118] [124] [133]
63	Tamsen Whitehead	[53] [54]
64	Roger Whitney	[17]
65	S. Gill Williamson (S. G. Williamson)	[83] [91]
66	Alexander Yakhnis	[44] [46] [56] [59]
67	Mei Yang	[28] [70]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page