 | 1999 |
|---|
| 12 |       | Ioan I. Macarie,
Joel I. Seiferas:
Amplification of slight probabilistic advantage at absolutely no cost in space.
Inf. Process. Lett. 72(3-4): 113-118 (1999) |
| 11 |  | Ioan I. Macarie:
On the Structure of Logspace Probabilistic Complexity Classes.
SIAM J. Comput. 29(3): 987-1007 (1999) |
| 1998 |
|---|
| 10 | | Ioan I. Macarie:
Space-Efficient Deterministic Simulation of Probabilistic Automata.
SIAM J. Comput. 27(2): 448-465 (1998) |
| 9 | | Ioan I. Macarie,
Mitsunori Ogihara:
Properties of Probabilistic Pushdown Automata.
Theor. Comput. Sci. 207(1): 117-130 (1998) |
| 1997 |
|---|
| 8 | | Ioan I. Macarie:
Multihead Two-Way Probabilistic Finite Automata.
Theory Comput. Syst. 30(1): 91-109 (1997) |
| 1996 |
|---|
| 7 | | Ioan I. Macarie:
A Note of Multihead Finite-State Automata.
Int. J. Found. Comput. Sci. 7(4): 329- (1996) |
| 1995 |
|---|
| 6 | | Ioan I. Macarie,
Mitsunori Ogihara:
Properties of Probabilistic Pushdown Automata (Extended Abstract).
FCT 1995: 343-352 |
| 5 | | Ioan I. Macarie:
Multihead Two-Way probabilistic Finite Automata.
LATIN 1995: 371-385 |
| 4 | | Ioan I. Macarie:
On the Structure of Log-Space Probabilistic Complexity Classes (Extended Abstract).
STACS 1995: 583-596 |
| 3 | | Ioan I. Macarie:
Decreasing the Bandwidth of a Transition Matrix.
Inf. Process. Lett. 53(6): 315-320 (1995) |
| 1994 |
|---|
| 2 | | Ioan I. Macarie:
Space-Efficient Deterministic Simulation of Probabilistic Automata (Extended Abstract).
STACS 1994: 109-122 |
| 1 | | Paul F. Dietz,
Ioan I. Macarie,
Joel I. Seiferas:
Bits and Relative Order From Residues, Space Efficiently.
Inf. Process. Lett. 50(3): 123-127 (1994) |
