1209 search results - page 120 / 242 » Universal Algebra and Computer Science |
148
click to vote
PKC
2011
Springer
14 years 6 months ago
2011
Springer
xtended abstract which appears in the 2011 International Conference on Theory and Practice in Public Key Cryptography PKC 2011 (6–9 march 2011, Taormina, Italy) D. Catalano, N. F...
127
click to vote
SIGCSE
2005
ACM
15 years 8 months ago
2005
ACM
Operating system courses teach students much more when they provide hands-on kernel-level project experience with a real operating system. However, enabling a large class of stude...
129
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
150
click to vote
CSR
2007
Springer
15 years 9 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
138
click to vote
FCT
1999
Springer
15 years 7 months ago
1999
Springer
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directi...