Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
unbounded memory
Description:
Unbounded memory is a theoretical property of computational or dynamical systems in which dependence on past states is not restricted to a finite time horizon.
Related topics:
semigroups and automata theory (16%),
Distributed systems and fault tolerance (8%)
OpenAlex ID:
keywords/unbounded-memory
Linear Algorithm for Data Compression via String Matching
1981
·
Michael Rodeh
, Vaughan R. Pratt
, et al.
·
Journal of the ACM
·
246
PDF
What Is an Algorithm?
2001
·
Yiannis N. Moschovakis
·
Springer eBooks
·
217
The complexity of reasoning about knowledge and time
1986
·
J Y Halpern
, M Y Vardi
·
ACM Symposium on Theory of Computing (STOC)
·
195
PDF
Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
2015
·
Venkata Koppula
, Allison Bishop Lewko
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
160
A theory of formal synthesis via inductive learning
2017
·
Susmit Jha
, Sanjit A. Seshia
·
Acta Informatica
·
151
PDF
Comparison Under Abstraction for Verifying Linearizability
2007
·
Daphna Amit
, Noam Rinetzky
, et al.
·
Springer eBooks
·
137
Consistency in dataflow graphs
1991
·
E.A. Lee
·
IEEE Transactions on Parallel and Distributed Systems
·
137
Central limit theorem and related results for the elephant random walk
2017
·
Cristian F. Coletti
, Renato Gava
, et al.
·
Journal of Mathematical Physics
·
110
PDF
Indexed Predicate Discovery for Unbounded System Verification
2004
·
Shuvendu K. Lahiri
, Randal E. Bryant
·
Lecture notes in computer science
·
100
A strong invariance principle for the elephant random walk
2017
·
Cristian F Coletti
, Renato Gava
, et al.
·
Journal of Statistical Mechanics Theory and Experiment
·
80
PDF
Destabilization by output feedback
1992
·
D. Hinrichsen
, A. J. Pritchard
·
Differential and Integral Equations
·
65
Continuous -methods for the Stochastic Pantograph Equation
2000
·
Christopher Baker
, Evelyn Buckwar
·
ETNA - Electronic Transactions on Numerical Analysis
·
61
Model checking transactional memories
2008
·
Rachid Guerraoui
, Thomas A. Henzinger
, et al.
·
ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)
·
54
PDF
Causal Asymmetry in a Quantum World
2018
·
Jayne Thompson
, Andrew J. P. Garner
, et al.
·
Physical Review X
·
53
PDF
Uniform dynamic self-stabilizing leader election
2005
·
Shlomi Dolev
, Amos Israeli
, et al.
·
Springer eBooks
·
35
How (not) to think about idealisation and ceteris paribus-laws
2008
·
Robert Kowalenko
·
Synthese
·
29
PDF
Bounded Concurrent Time-Stamp Systems Are Constructible
1989
·
Danny Dolev
, Nir Shavit
·
Defense Technical Information Center (DTIC)
·
27
Convergence and stability of a numerical method for nonlinear stochastic pantograph equations
2014
·
Haiying Zhang
, Yu Xiao
, et al.
·
Journal of the Franklin Institute
·
25
A self-stabilizing transformer for population protocols with covering
2010
·
Joffroy Beauquier
, Janna Burman
, et al.
·
Theoretical Computer Science
·
24
Periodic solutions of discrete Volterra equations
2003
·
Christopher T.H Baker
, Yihong Song
·
Mathematics and Computers in Simulation
·
24
PDF
Regenerative properties of the linear Hawkes process with unbounded memory
2021
·
Carl Graham
·
The Annals of Applied Probability
·
23
PDF
On computability by certain classes of restricted turing machines
1963
·
Patrick C. Fischer
·
Annual Symposium on Switching Circuit Theory and Logical Design (SWCT)
·
19
Biomolecular Implementation of Computing Devices with Unbounded Memory
2005
·
Matteo Cavaliere
, Nataša Jonoska
, et al.
·
Lecture notes in computer science
·
18
Population protocols with faulty interactions: The impact of a leader
2018
·
Giuseppe A. Di Luna
, Paola Flocchini
, et al.
·
Theoretical Computer Science
·
17
PDF
Autonomous push-down automaton built on DNA
2011
·
Krasinski, Tadeusz
, Sakowski, Sebastian
, et al.
·
Informatica
·
17
PDF
Show more works
View as search
Works count:
94
Citation count:
2,320
Year
Topic
Type