• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 75,218
Next 10 →

History and Contributions of Theoretical Computer Science

by John E. Savage, Alan L. Selman, Carl Smith
"... We briefly review some of the major accomplishements of theoretical computer science. Results from theoretical computer science have had enormous impact on the developement of programming languages and other areas of computer science. The impact of reseach in theoretical computer science is now bein ..."
Abstract - Add to MetaCart
We briefly review some of the major accomplishements of theoretical computer science. Results from theoretical computer science have had enormous impact on the developement of programming languages and other areas of computer science. The impact of reseach in theoretical computer science is now

Abstract Theoretical Computer Science

by P. Crescenziaj, P. Pennab
"... Strictly-upward drawings of ordered search trees ..."
Abstract - Add to MetaCart
Strictly-upward drawings of ordered search trees

Chair of Theoretical Computer Science

by Jevgeni Kabanov, Supervisor Varmo Vene , 2007
"... ..."
Abstract - Add to MetaCart
Abstract not found

Laboratory for Theoretical Computer Science,

by Keijo Heljanko, Tommi Junttila, Keijo Heljanko, Toni Jussila Johannes, Eth Zürich , 2006
"... Thanks to co-authors on papers related to bounded model checking (in alphabetic order): ..."
Abstract - Add to MetaCart
Thanks to co-authors on papers related to bounded model checking (in alphabetic order):

Theoretical Computer Science

by Michele Boreale A, Davide Sangiorgi B , 1996
"... Communicated by J.W. de Bakker Both for interleaving and for non-interleaving semantics, several variants of a x-calculus bisim-ilarity can be given which differ on the requirements imposed on name instantiations. Examples are the late, early, open and ground variants. The ground variant is the simp ..."
Abstract - Add to MetaCart
Communicated by J.W. de Bakker Both for interleaving and for non-interleaving semantics, several variants of a x-calculus bisim-ilarity can be given which differ on the requirements imposed on name instantiations. Examples are the late, early, open and ground variants. The ground variant is the simplest because it places no requirements on name instantiations. With the exception of open bisimilarities, none of the bisimilarity considered in the literature is a congruence relation on the full n-calculus language. We show that in the case of (certain forms of) causul bisimulation the late, early, open and ground variants coincide and are congruence relations in the sublanguage of the n-calculus without matching. We also show that to obtain the same results in the case of the interleaving bisimilarity, in addition to forbidding matching it is necessary to constrain the output prefix.

Theoretical Computer Science

by John Mullins, Communicated M. Nivat
"... On an effective hierarchy of communicating processes: separation principle and testing’ ..."
Abstract - Add to MetaCart
On an effective hierarchy of communicating processes: separation principle and testing’

Theoretical Computer Science Group

by Sebastian Kusch, Supervisor Dipl. -math, Markus Kaiser
"... Hiermit versichere ich, die vorliegende Diplomarbeit ohne Hilfe Dritter und nur mit den angegebenen Quellen und Hilfsmitteln angefertigt zu haben. Alle Stellen, die aus den Quellen entnommen wurden, sind als solche kenntlich gemacht worden. Diese Arbeit hat in gleicher oder ähnlicher Form noch keine ..."
Abstract - Add to MetaCart
Hiermit versichere ich, die vorliegende Diplomarbeit ohne Hilfe Dritter und nur mit den angegebenen Quellen und Hilfsmitteln angefertigt zu haben. Alle Stellen, die aus den Quellen entnommen wurden, sind als solche kenntlich gemacht worden. Diese Arbeit hat in gleicher oder ähnlicher Form noch keiner Prüfungsbehörde vorgelegen.

Emerging Opportunities for Theoretical Computer Science

by Alfred Aho, David S. Johnson, Richard M. Karp (chair, S. Rao Kosaraju, Catherine C. Mcgeoch, Christos H. Papadimitriou, Pavel Pevzner , 1996
"... The principles underlying this report can be summarized as follows: 1. A strong theoretical foundation is vital to computer science. 2. Theory can be enriched by practice. 3. Practice can be enriched by theory. 4. If we consider (2) and (3), the value, impact, and funding of theory will be enhanced. ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
The principles underlying this report can be summarized as follows: 1. A strong theoretical foundation is vital to computer science. 2. Theory can be enriched by practice. 3. Practice can be enriched by theory. 4. If we consider (2) and (3), the value, impact, and funding of theory will be enhanced

Topology, Domain Theory and Theoretical Computer Science

by Michael W. Mislove , 1997
"... In this paper, we survey the use of order-theoretic topology in theoretical computer science, with an emphasis on applications of domain theory. Our focus is on the uses of order-theoretic topology in programming language semantics, and on problems of potential interest to topologists that stem from ..."
Abstract - Cited by 13 (2 self) - Add to MetaCart
In this paper, we survey the use of order-theoretic topology in theoretical computer science, with an emphasis on applications of domain theory. Our focus is on the uses of order-theoretic topology in programming language semantics, and on problems of potential interest to topologists that stem

What is Theoretical Computer Science? (Preliminary Version)

by Luca Aceto, Anna Ingolfsdottir
"... This article presents a bird’s eye view of Theoretical Computer Science aimed at a general scientific audience. It then focuses on a selected area within this general field, and discusses some of the applications of results from that area and of the fundamental theoretical questions that drive its d ..."
Abstract - Add to MetaCart
This article presents a bird’s eye view of Theoretical Computer Science aimed at a general scientific audience. It then focuses on a selected area within this general field, and discusses some of the applications of results from that area and of the fundamental theoretical questions that drive its
Next 10 →
Results 1 - 10 of 75,218
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University