Ioan I. Macarie

According to our database, Ioan I. Macarie authored at least 12 papers between 1994 and 1999.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

1999

On the Structure of Logspace Probabilistic Complexity Classes.

Ioan I. Macarie

SIAM J. Comput., 1999

Amplification of slight probabilistic advantage at absolutely no cost in space.

Ioan I. Macarie, Joel I. Seiferas

Inf. Process. Lett., 1999

1998

Properties of Probabilistic Pushdown Automata.

Ioan I. Macarie, Mitsunori Ogihara

Theor. Comput. Sci., 1998

Space-Efficient Deterministic Simulation of Probabilistic Automata.

Ioan I. Macarie

SIAM J. Comput., 1998

1996

A Note of Multihead Finite-State Automata.

Ioan I. Macarie

Int. J. Found. Comput. Sci., 1996

1995

Space-bounded probabilistic computation: old and new stories.

Ioan I. Macarie

SIGACT News, 1995

Decreasing the Bandwidth of a Transition Matrix.

Ioan I. Macarie

Inf. Process. Lett., 1995

On the Structure of Log-Space Probabilistic Complexity Classes (Extended Abstract).

Ioan I. Macarie

Proceedings of the STACS 95, 1995

Multihead Two-Way probabilistic Finite Automata.

Ioan I. Macarie

Proceedings of the LATIN '95: Theoretical Informatics, 1995

Properties of Probabilistic Pushdown Automata (Extended Abstract).

Ioan I. Macarie, Mitsunori Ogihara

Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

1994

Bits and Relative Order From Residues, Space Efficiently.

Paul F. Dietz, Ioan I. Macarie, Joel I. Seiferas

Inf. Process. Lett., 1994

Space-Efficient Deterministic Simulation of Probabilistic Automata (Extended Abstract).

Ioan I. Macarie

Proceedings of the STACS 94, 1994