We stand with Ukraine

We stand with Ukraine

Ana Pasztor

Affiliations:

Florida International University, University Park, FL, USA

According to our database¹, Ana Pasztor authored at least 18 papers between 1982 and 2009.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

on cs.fiu.edu

On csauthors.net:

Bibliography

2009

Second Life, Bio-Sensors, and Exposure Therapy for Anxiety Disorders.

[BibT_eX]

[DOI]

Christine L. Lisetti

,

,

,

Frank Hernandez

,

Wendy Silverman

,

,

Proceedings of the Annual Review of Cybertherapy and Telemedicine 2009, 2009

2008

A conceptual approach to teaching induction for computer science.

[BibT_eX]

[DOI]

Irene Polycarpou

,

,

Proceedings of the 39th SIGCSE Technical Symposium on Computer Science Education, 2008

An Interactive and Multimodal Software for Teaching Induction for Computer Science.

[BibT_eX]

Irene Polycarpou

,

Proceedings of the 2008 International Conference on Frontiers in Education: Computer Science & Computer Engineering, 2008

2002

Constructing Design Worlds.

[BibT_eX]

[DOI]

,

Proceedings of the Artificial Intelligence in Design '02, 2002

1995

LUIS - A logic for task-oriented user interface specification.

[BibT_eX]

[DOI]

,

Int. J. Intell. Syst., 1995

The Chunking Engine: Closing the Gap Between Formal and Informal Design Specifications.

[BibT_eX]

[DOI]

,

Proceedings of the Eighth International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, 1995

1994

Formal specification for design automation.

[BibT_eX]

,

,

Proceedings of the Formal Design Methods for CAD, 1994

How Much Knowledge is Needed? (Co-)Evolutionary Design.

[BibT_eX]

[DOI]

,

Proceedings of the Seventh International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, 1994

1990

Recursive Programs and Denotational Semantics in Absolute Logics of Programs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1990

A Sup-Preserving Completion of Ordered Partial Algebras.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

1989

Does "N+1 Times" Prove More Programs Correct Than "N Times"?

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Programming Semantics, 5th International Conference, Tulane University, New Orleans, Louisiana, USA, March 29, 1989

A Streamlined Temporal Completeness Theorem.

[BibT_eX]

[DOI]

,

Proceedings of the CSL '89, 1989

1988

Nonstandard Logics of Recursive Programs and Denotational Semantics.

[BibT_eX]

[DOI]

Proceedings of the Algebraic and Logic Programming, 1988

1986

Scott Induction and Closure under omega-Sups.

[BibT_eX]

[DOI]

,

Richard Statman

Theor. Comput. Sci., 1986

Non-Standard Algorithmic and Dynamic Logic.

[BibT_eX]

[DOI]

J. Symb. Comput., 1986

1985

On the Variety Concept of omega-Continuous Algebras. Application of a General Approach.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Programming Semantics, 1985

1983

Epis of some categories of Z-continuous partial algebras.

[BibT_eX]

[DOI]

Acta Cybern., 1983

1982

Epis need not be Dense.

[BibT_eX]

[DOI]

,

Theor. Comput. Sci., 1982

Loading...