Sciweavers

1209 search results - page 22 / 242
» Universal Algebra and Computer Science
Sort
View
AML
2008
57views more  AML 2008»
13 years 8 months ago
Sheaf toposes for realizability
We compare realizability models over partial combinatory algebras by embedding them into sheaf toposes. We then use the machinery of Grothendieck toposes and geometric morphisms t...
Steven Awodey, Andrej Bauer
FOCS
2007
IEEE
14 years 3 months ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis
SOFSEM
2009
Springer
14 years 5 months ago
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
Martin Dietzfelbinger, Ulf Schellbach
TCS
2011
13 years 3 months ago
Four states are enough!
This paper presents a 1D intrinsically universal cellular automaton with four states for a first neighbors neighborhood, improving on the previous lower bound and getting nearer ...
Nicolas Ollinger, Gaétan Richard
ITICSE
2005
ACM
14 years 2 months ago
Providing students universal access to a centralized, graphical computing environment
We investigate the use of a thin-client based configuration in providing students with universal access to a centralized, graphical computing environment. The primary goal is to ...
Michael H. Goldwasser, David Letscher