Ana Pasztor
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
5
Venues
4
Active years
1985–2008
Best venue rank
B
Where they publish
Papers
5 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2008 | SIGCSE | A conceptual approach to teaching induction for computer science. | Irene Polycarpou, Ana Pasztor, Malek Adjouadi |
| 1990 | MFCS | A Sup-Preserving Completion of Ordered Partial Algebras. | Ana Pasztor |
| 1989 | CSL | A Streamlined Temporal Completeness Theorem. | Ana Pasztor, Ildik Sain |
| 1989 | MFPS | Does "N+1 Times" Prove More Programs Correct Than "N Times"? | Ana Pasztor |
| 1985 | MFPS | On the Variety Concept of omega-Continuous Algebras. Application of a General Approach. | Ana Pasztor |