Skip to search formSkip to main contentSkip to account menu

Theoretical computer science

Known as: Computer science theory, Theoretical Computer Science (disambiguation), Theoretical computer scientist 
Theoretical computer science is a division or subset of general computer science and mathematics that focuses on more abstract or mathematical… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
ACM Turing AwardAbstract rewriting systemAutomatonBiological computation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2004
2004
Problem-based learning of theoretical computer science
In this paper, we report our first experiment in teaching the theory of computability in the problem-based way. As far as we know… 
2003
2003
Dynamic profiling and trace cache generation
Dynamic program optimization is increasingly important for achieving good runtime performance. A key issue is how to select which… 
2003
2003
Relating caesium-137 and soil loss from cultivated land
Because of the limitations associated with traditional methods of measuring rates of soil erosion, such as erosion plots, the… 
Review
2002
Review
2002
What can automatic programming learn from theoretical computer science
This paper considers two (seemingly) radically different perspectives on the construction of software. On one hand, search-based… 
1999
1999
People & ideas in theoretical computer science
The Forbidden Sidetrip (Laszlo Babai).- Elegant Lisp Programs (Gregory J. Chaitin).- From Logic to Computer Science and back… 
1998
1998
Cognitive Units, Concept Images, and Cognitive Collages: An Examination of the Processes of Knowledge Construction
The fragmentation of strategies that distinguishes the more successful elementary grade students from those least successful has… 
1996
1996
A Machine Verified Distributed Sorting Algorithm
We present a verification of a distributed sorting algorithm in ALF, an implementation of Martin L¨of's type theory. The… 
1995
1995
The Programming Environment of the SB-PRAM
The SB-PRAM realizes the theoretical CRCW-PRAM computing model. In this paper the SB-PRAM system is described from a programmer's… 
1988
1988
Two solvable cases of the Traveling Salesman Problem
In the Euclidean Traveling Salesman Problem, a set of points in the plane is given, and we look for a shortest closed curve… 
1982
1982
On teaching theoretical foundations of Computer Science
Theoretical foundations of Computer Science (Automata Theory, Complexity, Formal Languages . . .) are taught almost everywhere… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)