default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAna Pasztor
Person information
- affiliation: Florida International University, University Park, FL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[p1]Christine L. Lisetti
, Emmanuel Pozzo, Marie Lucas, Frank Hernandez, Wendy Silverman, Bill Kurtines, Ana Pasztor:
Second Life, Bio-Sensors, and Exposure Therapy for Anxiety Disorders. Annual Review of Cybertherapy and Telemedicine 2009: 19-21- 2008
- [c11]Irene Polycarpou, Ana Pasztor:
An Interactive and Multimodal Software for Teaching Induction for Computer Science. FECS 2008: 326-331 - [c10]Irene Polycarpou, Ana Pasztor, Malek Adjouadi:
A conceptual approach to teaching induction for computer science. SIGCSE 2008: 9-13 - 2002
- [c9]Mihaly Lenart, Ana Pasztor:
Constructing Design Worlds. AID 2002: 65-88
1990 – 1999
- 1995
- [j6]Chris Stary, Ana Pasztor:
LUIS - A logic for task-oriented user interface specification. Int. J. Intell. Syst. 10(2): 201-231 (1995) - [c8]Mihaly Lenart, Ana Pasztor:
The Chunking Engine: Closing the Gap Between Formal and Informal Design Specifications. IEA/AIE 1995: 491-499 - 1994
- [c7]Mihaly Lenart, Ana Pasztor:
How Much Knowledge is Needed? (Co-)Evolutionary Design. IEA/AIE 1994: 413-419 - [c6]Mihaly Lenart, Peter Padawitz, Ana Pasztor:
Formal specification for design automation. Formal Design Methods for CAD 1994: 201-220 - 1990
- [j5]Ana Pasztor:
Recursive Programs and Denotational Semantics in Absolute Logics of Programs. Theor. Comput. Sci. 70(1): 127-150 (1990) - [c5]Ana Pasztor:
A Sup-Preserving Completion of Ordered Partial Algebras. MFCS 1990: 446-456
1980 – 1989
- 1989
- [c4]Ana Pasztor, Ildikó Sain:
A Streamlined Temporal Completeness Theorem. CSL 1989: 322-336 - [c3]Ana Pasztor:
Does "N+1 Times" Prove More Programs Correct Than "N Times"? Mathematical Foundations of Programming Semantics 1989: 373-389 - 1988
- [c2]Ana Pasztor:
Nonstandard Logics of Recursive Programs and Denotational Semantics. ALP 1988: 255-278 - 1986
- [j4]Ana Pasztor:
Non-Standard Algorithmic and Dynamic Logic. J. Symb. Comput. 2(1): 59-81 (1986) - [j3]Ana Pasztor, Richard Statman:
Scott Induction and Closure under omega-Sups. Theor. Comput. Sci. 43: 251-263 (1986) - 1985
- [c1]Ana Pasztor:
On the Variety Concept of omega-Continuous Algebras. Application of a General Approach. Mathematical Foundations of Programming Semantics 1985: 215-248 - 1983
- [j2]Ana Pasztor:
Epis of some categories of Z-continuous partial algebras. Acta Cybern. 6(1): 111-123 (1983) - 1982
- [j1]Daniel Lehmann, Ana Pasztor:
Epis need not be Dense. Theor. Comput. Sci. 17: 151-161 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-26 01:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
