Product
Help
Pricing
About
Jobs
Log in
Get started
Concept
Add to collection
Memoization
OpenAlex ID:
C79516417
An efficient augmented-context-free parsing algorithm
1987
·
Masaru Tomita
·
OLAC - Open Language Archives Community
·
242
Dynamic Programming for Linear-Time Incremental Parsing
2010
·
Liang Huang
, Kenji Sagae
·
234
The design principles of a weighted finite-state transducer library
2000
·
Mehryar Mohri
, Fernando Pereira
, et al.
·
Theoretical Computer Science
·
205
PDF
Fuzzy Memoization for Floating-Point Multimedia Applications
2005
·
C. Alvarez
, J. Corbal
, et al.
·
IEEE Transactions on Computers
·
184
PDF
A Robust Parsing Algorithm For Link Grammars
1995
·
Grinberg, Dennis
, Lafferty, John
, et al.
·
arXiv (Cornell University)
·
157
PDF
Bilexical Grammars and their Cubic-Time Parsing Algorithms
2000
·
Jason Eisner
·
Text, speech and language technology
·
144
Dynamic programming strikes back
2008
·
Guido Moerkotte
, Thomas Neumann
·
ACM SIGMOD International Conference on Management of Data (SIGMOD)
·
136
Better extensibility through modular syntax
2006
·
Robert Grimm
·
ACM SIGPLAN Notices
·
126
Stable deterministic multithreading through schedule memoization
2010
·
Heming Cui
, Jingyue Wu
, et al.
·
Operating Systems Design and Implementation
·
118
Better extensibility through modular syntax
2006
·
Robert Grimm
·
ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)
·
118
Exploiting Lineage for Confidence Computation in Uncertain and Probabilistic Databases
2008
·
Anish Das Sarma
, Martin Theobald
, et al.
·
IEEE International Conference on Data Engineering (ICDE)
·
117
Selective memoization
2003
·
Umut A. Acar
, Guy E. Blelloch
, et al.
·
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)
·
112
Proving acceptability properties of relaxed nondeterministic approximate programs
2012
·
Michael Carbin
, Deokhwan Kim
, et al.
·
ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)
·
110
Query execution techniques for caching expensive methods
1996
·
Joseph M. Hellerstein
, Jeffrey F. Naughton
·
ACM SIGMOD International Conference on Management of Data (SIGMOD)
·
106
Fast out-of-order processor simulation using memoization
1998
·
Eric Schnarr
, James R. Larus
·
ACM SIGPLAN Notices
·
100
DLHub: Model and Data Serving for Science
2019
·
Ryan Chard
, Zhuozhao Li
, et al.
·
IEEE International Parallel and Distributed Processing Symposium (IPDPS)
·
96
PDF
Solving #SAT and Bayesian Inference with Backtracking Search
2009
·
F. Bacchus
, S. Dalmao
, et al.
·
Journal of Artificial Intelligence Research
·
95
PDF
Self-adjusting computation
2004
·
Robert Harper
·
Logic in Computer Science
·
89
Caching Function Results: Faster Arithmetic by Avoiding Unnecessary Computation
1992
·
Stephen Richardson
·
89
IncApprox: A Data Analytics System for Incremental Approximate Computing
2016
·
Dhanya R. Krishnan
, Do Le Quoc
, et al.
·
International World Wide Web Conference (WWW)
·
87
Fast out-of-order processor simulation using memoization
1998
·
Eric Schnarr
, James R. Larus
·
International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS)
·
87
PDF
fundiversity: a modular R package to compute functional diversity indices
2023
·
Matthias Grenié
, Hugo Gruson
·
Ecography
·
82
PDF
An experimental analysis of self-adjusting computation
2009
·
Umut A. Acar
, Guy E. Blelloch
, et al.
·
ACM Transactions on Programming Languages and Systems
·
80
PDF
Flow analysis of lazy higher-order functional programs
2006
·
Neil D. Jones
, Nils Andersen
·
Theoretical Computer Science
·
76
PDF
A new, simpler linear-time dominators algorithm
1998
·
Adam L. Buchsbaum
, Haim Kaplan
, et al.
·
ACM Transactions on Programming Languages and Systems
·
73
PDF
Show more works
View as search
Works count:
772
Citation count:
8,703
Year
Topic
Type