dblp.uni-trier.dewww.uni-trier.de

Jeffrey B. Remmel Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
127EEDouglas A. Cenzer, Valentina Harizanov, Jeffrey B. Remmel: S01 and P01 Equivalence Structures. CiE 2009: 99-108
126EEVictor W. Marek, Jeffrey B. Remmel: Automata and Answer Set Programming. LFCS 2009: 323-337
125EEV. Wiktor Marek, Jeffrey B. Remmel: Guarded resolution for answer set programming CoRR abs/0904.3953: (2009)
124EEVictor W. Marek, Jeffrey B. Remmel: An Application of Proof-Theory in answer Set Programming CoRR abs/0905.0197: (2009)
123EEGeorge 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
122EEVictor W. Marek, Jeffrey B. Remmel: On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP. ICLP 2008: 223-237
121EEAlin Deutsch, Alan Nash, Jeffrey B. Remmel: The chase revisited. PODS 2008: 149-158
120EEHoward A. Blair, Victor W. Marek, Jeffrey B. Remmel: Set based logic programming. Ann. Math. Artif. Intell. 52(1): 81-105 (2008)
119EEAnil Nerode, Jeffrey B. Remmel: Consistency properties and set based logic programming. Ann. Math. Artif. Intell. 53(1-4): 289-311 (2008)
118EEJeffrey B. Remmel: My work with Victor Marek: a mathematician looks at answer set programming. Ann. Math. Artif. Intell. 53(1-4): 5-16 (2008)
117EEGeorge 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)
116EEAnthony Mendes, Jeffrey B. Remmel: Descents, inversions, and major indices in permutation groups. Discrete Mathematics 308(12): 2509-2524 (2008)
115EESergey 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)
114EEJohn T. Hall, Jeffrey B. Remmel: Counting descent pairs with prescribed tops and bottoms. J. Comb. Theory, Ser. A 115(5): 693-725 (2008)
2007
113EEGeorge Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber: K -Trivial Closed Sets and Continuous Functions. CiE 2007: 135-145
112EEVictor W. Marek, Jeffrey B. Remmel: Compactness Properties for Stable Semantics of Logic Programs. LFCS 2007: 379-400
111EEPaul Brodhead, Douglas Cenzer, Jeffrey B. Remmel: Random Continuous Functions. Electr. Notes Theor. Comput. Sci. 167: 275-287 (2007)
110EEVictor W. Marek, Jeffrey B. Remmel: Compactness Properties for Stable Semantics of Logic Programs. Fundam. Inform. 81(1-3): 211-239 (2007)
2006
109EESergey Kitaev, Jeffrey B. Remmel: Classifying Descents According to Equivalence mod k. Electr. J. Comb. 13(1): (2006)
108EEAndrius Kulikauskas, Jeffrey B. Remmel: Lyndon Words and Transition Matrices between Elementary, Homogeneous and Monomial Symmetric Functions. Electr. J. Comb. 13(1): (2006)
107EEAlan Nash, Russell Impagliazzo, Jeffrey B. Remmel: Infinitely-Often Universal Languages and Diagonalization. Electronic Colloquium on Computational Complexity (ECCC) 13(051): (2006)
106EEKaren 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)
105EEDouglas A. Cenzer, Jeffrey B. Remmel: On the complexity of inductive definitions. Mathematical Structures in Computer Science 16(5): 763-788 (2006)
2005
104EEDouglas A. Cenzer, Jeffrey B. Remmel: The Complexity of Inductive Definability. CiE 2005: 75-85
103EEAlan Nash, Jeffrey B. Remmel, Victor Vianu: PTIME Queries Revisited. ICDT 2005: 274-288
102EEVictor W. Marek, Jeffrey B. Remmel: Normal Form Theorem for Logic Programs with Cardinality Constraints. Nonmonotonic Reasoning, Answer Set Programming and Constraints 2005
101EEJeffrey B. Remmel, Victor W. Marek: Set Based Logic Programming. Nonmonotonic Reasoning, Answer Set Programming and Constraints 2005
100EEDouglas A. Cenzer, Jeffrey B. Remmel, Victor W. Marek: Logic programming with infinite sets. Ann. Math. Artif. Intell. 44(4): 309-339 (2005)
99EEJames 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
98EEDouglas A. Cenzer, V. Wiktor Marek, Jeffrey B. Remmel: Using Logic Programs to Reason about Infinite Sets. AMAI 2004
97EEV. Wiktor Marek, Jeffrey B. Remmel: Set Constraints in Logic Programming. LPNMR 2004: 167-179
96EEVictor W. Marek, Jeffrey B. Remmel: Answer set programming with default logic. NMR 2004: 276-284
95EEDavid A. Meyer, James Pommersheim, Jeffrey B. Remmel: Finding stable models via quantum computation. NMR 2004: 285-291
94EEDouglas 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)
93EEJames Haglund, Jeffrey B. Remmel: Cycles and perfect matchings. Discrete Mathematics 274(1-3): 93-108 (2004)
92EEAnthony Mendes, Jeffrey B. Remmel, Jennifer Wagner: A lambda-ring Frobenius Characteristic for G wreath Sn. Electr. J. Comb. 11(1): (2004)
91EENicholas A. Loehr, Jeffrey B. Remmel: Conjectured Combinatorial Models for the Hilbert Series of Generalized Diagonal Harmonics Modules. Electr. J. Comb. 11(1): (2004)
90EET. M. Langley, Jeffrey B. Remmel: The Plethysm s?[s?] at Hook and Near-Hook Shapes. Electr. J. Comb. 11(1): (2004)
89EEÖ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)
88EEDouglas Cenzer, Jeffrey B. Remmel: Index sets for computable differential equations. Math. Log. Q. 50(4-5): 329-344 (2004)
2003
87EEAlan Nash, Russell Impagliazzo, Jeffrey B. Remmel: Universal Languages and the Power of Diagonalization. IEEE Conference on Computational Complexity 2003: 337-346
86EEV. Wiktor Marek, Jeffrey B. Remmel: On the Expressibility of Stable Logic Programming CoRR cs.AI/0312053: (2003)
85EEKaren S. Briggs, Jeffrey B. Remmel: A p, q-analogue of a Formula of Frobenius. Electr. J. Comb. 10: (2003)
84EEDouglas A. Cenzer, Jeffrey B. Remmel: Index sets for omega-languages. Math. Log. Q. 49(1): 22-33 (2003)
83 V. Wiktor Marek, Jeffrey B. Remmel: On the expressibility of stable logic programming. TPLP 3(4-5): 551-567 (2003)
2002
82 Victor W. Marek, Jeffrey B. Remmel: On logic programs with cardinality constraints. NMR 2002: 219-228
81EEJeffrey B. Remmel, S. G. Williamson: Spanning Trees and Function Classes. Electr. J. Comb. 9(1): (2002)
80EEDouglas A. Cenzer, Jeffrey B. Remmel: Effectively closed sets and graphs of computable real functions. Theor. Comput. Sci. 284(2): 279-318 (2002)
2001
79EEVictor W. Marek, Jeffrey B. Remmel: On the Foundations of Answer Set Programming. Answer Set Programming 2001
78EEV. Wiktor Marek, Jeffrey B. Remmel: On the Expressibility of Stable Logic Programming. LPNMR 2001: 107-120
2000
77EEDouglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt: Characterizing the Set of Extensions of a Nonmonotonic Rule System with Levels. AMAI 2000
1999
76EEDouglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt: Locally Determined Logic Programs. LPNMR 1999: 34-48
75 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)
74EEDouglas A. Cenzer, Jeffrey B. Remmel: Index Sets in Computable Analysis. Theor. Comput. Sci. 219(1-2): 111-150 (1999)
1998
73 Douglas A. Cenzer, Jeffrey B. Remmel: Preface. Ann. Pure Appl. Logic 93(1-3): 1-2 (1998)
72 Douglas A. Cenzer, Jeffrey B. Remmel: Index Sets for Pi01 Classes. Ann. Pure Appl. Logic 93(1-3): 3-61 (1998)
71 Douglas A. Cenzer, Jeffrey B. Remmel: Feasible Graphs with Standard Universe. Ann. Pure Appl. Logic 94(1-3): 21-35 (1998)
70EELuisa 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)
69EEJeffrey B. Remmel, Mark Shimozono: A simple proof of the Littlewood-Richardson rule and applications. Discrete Mathematics 193(1-3): 257-266 (1998)
68EEMei Yang, Jeffrey B. Remmel: Hook-Schur Functions Analogues of Littlewood's Identities and their Bijective Proofs. Eur. J. Comb. 19(2): 257-272 (1998)
67 Douglas A. Cenzer, Jeffrey B. Remmel: Complexity and Categoricity. Inf. Comput. 140(1): 2-25 (1998)
1997
66 Wolf Kohn, Jeffrey B. Remmel: Hybrid Dynamic Programming. HART 1997: 391-396
65EEWolf Kohn, Anil Nerode, Jeffrey B. Remmel: Scalble Data and Sensor Fusion via Multiple Agent Hybrid Systems. Hybrid Systems 1997: 122-141
64 V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel: Basic Forward Chaining Construction for Logic Programs. LFCS 1997: 214-225
63 Ch. Pollet, Jeffrey B. Remmel: Non-Monotonic Reasoning with Quantified Boolean Constraints. LPNMR 1997: 18-39
62 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)
61EEV. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel: Nonmonotonic rule systems with recursive sets of restraints. Arch. Math. Log. 36(4-5): 339-384 (1997)
60 V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel: Complexity of Recursive Normal Default Logic. Fundam. Inform. 32(2): 139-147 (1997)
59EEAnil Nerode, Jeffrey B. Remmel, V. S. Subrahmanian: Annotated Nonmonotonic Rule Systems. Theor. Comput. Sci. 171(1-2): 111-146 (1997)
1996
58 Wolf Kohn, Anil Nerode, Jeffrey B. Remmel: Agent Based Velocity Control of Highway Systems. Hybrid Systems 1996: 174-214
57 Anil Nerode, Jeffrey B. Remmel, Alexander Yakhnis: Hybrid System Games: Extraction of Control Automata with Small Topologies. Hybrid Systems 1996: 248-293
56 V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel: On the Complexity of Abduction. LICS 1996: 513-522
55EEJeffrey B. Remmel: Nonmonotonic Rule Systems: Foward Chaining, Constraints, and Complexity (Abstract). MFCS 1996: 113
54 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)
53 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)
52EEDesiree 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)
51EEArun Ram, Jeffrey B. Remmel, Tamsen Whitehead: Combinatorics of theq-Basis of Symmetric Functions. J. Comb. Theory, Ser. A 76(2): 231-271 (1996)
1995
50 Xiaolin Ge, Wolf Kohn, Anil Nerode, Jeffrey B. Remmel: Hybrid Systems: Chattering Approximation to Relaxed Controls. Hybrid Systems 1995: 76-100
49 V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel: Complexity of Normal Default Logic and Related Modes of Nonmonotonic Reasoning LICS 1995: 178-185
48 V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel: On Logical Constraints in Logic Programming. LPNMR 1995: 43-56
47 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)
46 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)
45 Jeffrey B. Remmel, Douglas A. Cenzer: Feasible Graphs and Colorings. Math. Log. Q. 41: 327-352 (1995)
44EEWolf Kohn, Anil Nerode, Jeffrey B. Remmel, Alexander Yakhnis: Viability in Hybrid Systems. Theor. Comput. Sci. 138(1): 141-168 (1995)
1994
43 Wolf Kohn, Anil Nerode, Jeffrey B. Remmel: Hybrid Systems as Finsler Manifolds: Finite State Control as Approximation to Connections. Hybrid Systems 1994: 294-321
42 Anil Nerode, Jeffrey B. Remmel, Alexander Yakhnis: Controllers as Fixed Points of Set-Valued Operators. Hybrid Systems 1994: 344-358
41 Douglas A. Cenzer, Jeffrey B. Remmel: Feasibly Categorial Models. LCC 1994: 300-312
40 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)
39 Frank A. Bäuerle, Jeffrey B. Remmel: On Speedable and Levelable Vector Spaces. Ann. Pure Appl. Logic 67(1-3): 61-112 (1994)
38 V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel: The Stable Models of a Predicate Logic Program. J. Log. Program. 21(3): 129-153 (1994)
1992
37 V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel: The Stable Models of a Predicate Logic Program. JICSLP 1992: 446-460
36 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
35 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)
34 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)
33 John N. Crossley, Jeffrey B. Remmel: Cancellation Laws for Polynomial-Time p-Isolated Sets. Ann. Pure Appl. Logic 56(1-3): 147-172 (1992)
32 Douglas A. Cenzer, Jeffrey B. Remmel: Polynomial-Time Abelian Groups. Ann. Pure Appl. Logic 56(1-3): 313-363 (1992)
31EEJeffrey 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
30 Douglas A. Cenzer, Jeffrey B. Remmel: Polynomial-Time versus Recursive Models. Ann. Pure Appl. Logic 54(1): 17-58 (1991)
29EEÖ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)
28 Carl G. Jockusch Jr., A. Lewis, Jeffrey B. Remmel: Pi01-Classes and Rado's Selection Principle. J. Symb. Log. 56(2): 684-693 (1991)
27 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
26 V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel: A Theory of Nonmonotonic Rule Systems LICS 1990: 79-94
25 V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel: A Theory of Nonmonotonic Rule Systems I. Ann. Math. Artif. Intell. 1: (1990)
24EEÖmer Egecioglu, Jeffrey B. Remmel: The monomial symmetric functions and the Frobenius map. J. Comb. Theory, Ser. A 54(2): 272-295 (1990)
1989
23 Anil Nerode, Jeffrey B. Remmel, Andre Scedrov: Polynomially Grade Logic I: A Graded Version of System T LICS 1989: 375-385
22 Rodney G. Downey, Jeffrey B. Remmel: Classification of Degree Classes Associated with r.e. Subspaces. Ann. Pure Appl. Logic 42(2): 105-124 (1989)
21 Anil Nerode, Jeffrey B. Remmel: Complexity-Theoretic Algebra II: Boolean Algebras. Ann. Pure Appl. Logic 44(1-2): 71-99 (1989)
1987
20EEJeffrey B. Remmel: Permutation statistics and (k, l)-hook Schur functions. Discrete Mathematics 67(3): 271-298 (1987)
1986
19EEAdriano M. Garsia, Jeffrey B. Remmel: Q-counting rook configurations and a formula of frobenius. J. Comb. Theory, Ser. A 41(2): 246-275 (1986)
18EEÖ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)
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

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

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)