| 1996 |
| 25 | EE | Celia Wrathall:
The lattices of prefixes and overlaps of traces.
Discrete Mathematics 158(1-3): 231-248 (1996) |
| 1995 |
| 24 | | Celia Wrathall,
Volker Diekert:
On Confluence of One-Rule Trace-Rewriting Systems.
Mathematical Systems Theory 28(4): 341-361 (1995) |
| 1992 |
| 23 | | Celia Wrathall,
Volker Diekert,
Friedrich Otto:
One-Rule Trace-Rewriting Systems and Confluence.
MFCS 1992: 511-521 |
| 1991 |
| 22 | EE | Celia Wrathall:
Trace monoids with some invertible generators: two decision problems.
Discrete Applied Mathematics 32(2): 211-222 (1991) |
| 21 | | Friedrich Otto,
Celia Wrathall:
Overlaps in Free Partially Commutative Monoids.
J. Comput. Syst. Sci. 42(2): 186-198 (1991) |
| 1990 |
| 20 | | Celia Wrathall:
Confluence of One-Rule Thue Systems.
IWWERT 1990: 237-246 |
| 19 | | Hai-Ning Liu,
Celia Wrathall,
Kenneth Zeger:
Efficient Solution to Some Problems in Free Partially Commutative Monoids
Inf. Comput. 89(2): 180-198 (1990) |
| 1988 |
| 18 | | Celia Wrathall:
The Word Problem for Free Partially Commutative Groups.
J. Symb. Comput. 6(1): 99-104 (1988) |
| 1986 |
| 17 | | Sheila A. Greibach,
Celia Wrathall:
Single-Tape Reset Machines.
ITA 20(1): 55-77 (1986) |
| 1985 |
| 16 | | Friedrich Otto,
Celia Wrathall:
A Note on Thue Systems with a Single Defining Relation.
Mathematical Systems Theory 18(2): 135-143 (1985) |
| 1982 |
| 15 | | Ronald V. Book,
Celia Wrathall:
A Note on Complete Sets and Transitive Closure.
Mathematical Systems Theory 15(4): 311-313 (1982) |
| 14 | | Craig C. Squier,
Celia Wrathall:
A Note on Representations of a Certain Monoid.
Theor. Comput. Sci. 17: 229-231 (1982) |
| 13 | | Ronald V. Book,
Matthias Jantzen,
Celia Wrathall:
Monadic Thue Systems.
Theor. Comput. Sci. 19: 231-251 (1982) |
| 1981 |
| 12 | | Ronald V. Book,
Matthias Jantzen,
Burkhard Monien,
Colm Ó'Dúnlaing,
Celia Wrathall:
On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report).
MFCS 1981: 216-223 |
| 11 | | Ronald V. Book,
Matthias Jantzen,
Celia Wrathall:
(Erasing)* Strings.
Theoretical Computer Science 1981: 252-259 |
| 10 | | Ronald V. Book,
Celia Wrathall:
Bounded Query Machines: On NP( ) and NPQERY( ).
Theor. Comput. Sci. 15: 41-50 (1981) |
| 1979 |
| 9 | EE | Donald B. Johnson,
Webb Miller,
Brian Minnihan,
Celia Wrathall:
Reducibility Among Floating-Point Graphs.
J. ACM 26(4): 739-760 (1979) |
| 8 | | Ronald V. Book,
Sheila A. Greibach,
Celia Wrathall:
Reset Machines.
J. Comput. Syst. Sci. 19(3): 256-276 (1979) |
| 1978 |
| 7 | | Ronald V. Book,
Sheila A. Greibach,
Celia Wrathall:
Comparisons and Reset Machines (Preliminary Report).
ICALP 1978: 113-124 |
| 6 | | Detlef Wotschke,
Celia Wrathall:
A Note on Classes of Complements and the LBA Problem.
Acta Inf. 10: 169-173 (1978) |
| 5 | | K. N. King,
Celia Wrathall:
Stack Languages and log n Space.
J. Comput. Syst. Sci. 17(3): 281-299 (1978) |
| 4 | | Celia Wrathall:
Rudimentary Predicates and Relative Computation.
SIAM J. Comput. 7(2): 194-209 (1978) |
| 1977 |
| 3 | | Celia Wrathall:
Characterizations of the Dyck Sets.
ITA 11(1): 53-62 (1977) |
| 2 | | Ronald V. Book,
Celia Wrathall,
Alan L. Selman,
David P. Dobkin:
Inclusion Complete Tally Languages and the Hartmanis-Berman Conjecture.
Mathematical Systems Theory 11: 1-8 (1977) |
| 1976 |
| 1 | | Celia Wrathall:
Complete Sets and the Polynomial-Time Hierarchy.
Theor. Comput. Sci. 3(1): 23-33 (1976) |