1209 search results - page 39 / 242 » Universal Algebra and Computer Science |
ICCS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. The high level of abstraction necessary to teach data structures and algorithmic schemes has been more than a hindrance to students. In order to make a proper approach to...
LICS
2005
IEEE
15 years 5 months ago
2005
IEEE
In the 1980s process algebras became widely accepted formalisms for describing and analysing concurrency. Extensions of the formalisms, incorporating some aspects of systems which...
80
Voted
SIGCSE
1999
ACM
15 years 4 months ago
1999
ACM
A Global Cooperation Project was conducted with computer science classes at the Czech Technical University and North Hennepin Community College. The project was a pilot project fo...
MLG
2007
Springer
15 years 5 months ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
LICS
2006
IEEE
15 years 5 months ago
2006
IEEE
Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi. An importa...