274 search results - page 1 / 55 » A Functional Language for Logarithmic Space |
APLAS
2004
ACM
13 years 10 months ago
2004
ACM
Abstract. More than being just a tool for expressing algorithms, a welldesigned programming language allows the user to express her ideas efficiently. The design choices however e...
APLAS
2010
ACM
13 years 3 months ago
2010
ACM
We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming langu...
COCO
2010
Springer
13 years 6 months ago
2010
Springer
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
FOCS
1997
IEEE
13 years 9 months ago
1997
IEEE
We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded computation can be made unambiguous. An analogous result holds for the class of pr...