Sciweavers

1448 search results - page 1 / 290
» Restricted Stack Implementations
Sort
View
WDAG
2005
Springer
77views Algorithms» more  WDAG 2005»
13 years 10 months ago
Restricted Stack Implementations
We introduce a new object, BH, and prove that a system with one BH object and single-writer Registers has the same computational power as a system with countably many commutative a...
Matei David, Alex Brodsky, Faith Ellen Fich
DNA
2004
Springer
168views Bioinformatics» more  DNA 2004»
13 years 10 months ago
Biomolecular Implementation of Computing Devices with Unbounded Memory
We propose a new way to implement (general) computing devices with unbounded memory. In particular, we show a procedure to implement automata with unbounded stack memory, push-down...
Matteo Cavaliere, Natasa Jonoska, Sivan Yogev, Ron...
PEPM
2011
ACM
12 years 7 months ago
Ordering multiple continuations on the stack
Passing multiple continuation arguments to a function in CPS form allows one to encode a wide variety of direct-style control constructs, such as conditionals, exceptions, and mul...
Dimitrios Vardoulakis, Olin Shivers
CC
2004
Springer
163views System Software» more  CC 2004»
13 years 10 months ago
Declarative Composition of Stack Frames
When a compiler translates a procedure, it must lay out the procedure’s stack frame in a way that respects the calling convention. Many compilers respect the convention either by...
Christian Lindig, Norman Ramsey
SIGMOD
2005
ACM
89views Database» more  SIGMOD 2005»
13 years 10 months ago
Stacked indexed views in microsoft SQL server
Appropriately selected materialized views (also called indexed views) can speed up query execution by orders of magnitude. Most database systems limit support for materialized vie...
David DeHaan, Per-Åke Larson, Jingren Zhou