A. Goralciková

According to our database1, A. Goralciková authored at least 7 papers between 1979 and 1991.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1991
Alternation with a Pebble.
Inf. Process. Lett., 1991

1986
How much Semigroup Structure is Needed to Encode Graphs?
RAIRO Theor. Informatics Appl., 1986

Some Improved Parallelisms for Graphs.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1982
A Boundary of Isomorphism Completeness in the Lattice of Semigroup Pseudovarieties.
Proceedings of the Automata, 1982

1981
Fast Recognition of Rings and Lattices.
Proceedings of the Fundamentals of Computation Theory, 1981

1980
Testing of Properties of Finite Algebras.
Proceedings of the Automata, 1980

1979
A Reduct-and-Closure Algorithm for Graphs.
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979


  Loading...