1209 search results - page 86 / 242 » Universal Algebra and Computer Science |
106
Voted
DLT
2009
15 years 10 days ago
2009
Seki et al. (1991) proved a rather weak pumping lemma for multiple context-free languages, which says that any infinite m-multiple context-free language contains a string that is p...
111
Voted
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Valiant’s theory of holographic algorithms is a novel methodology to achieve exponential speedups in computation. A fundamental parameter in holographic algorithms is the dimens...
SIGCSE
2008
ACM
15 years 2 months ago
2008
ACM
Computer games are a multi-billion dollar industry and have become an important part of our private and social lives. It is only natural, then, that the technology used to create ...
104
click to vote
COMPGEOM
1995
ACM
15 years 6 months ago
1995
ACM
Abstract. We show that there is a matching between the edges of any two triangulations of a planar point set such that an edge of one triangulation is matched either to the identic...
113
Voted
CHI
2009
ACM
16 years 3 months ago
2009
ACM
We present Waterhouse, a system for sending and receiving cryptographically protected electronic mail ("secure e-mail"). We show how an existing e-mail interface can be ...