Trie memory

Edward Fredkin

doi:10.1145/367390.367400

Abstract

article Free AccessTrie memory Author: Edward Fredkin Bolt Beranek and Newman, Inc., Cambridge, MA Bolt Beranek and Newman, Inc., Cambridge, MAView Profile Authors Info & Claims Communications of the ACMVolume 3Issue 9September 1960 pp 490–499https://doi.org/10.1145/367390.367400Published:01 September 1960Publication History 801citation4,528DownloadsMetricsTotal Citations801Total Downloads4,528Last 12 Months376Last 6 weeks118 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

Keywords

CitationComputer scienceWorld Wide Web

Related Publications

End-To-End Arguments In System Design

Jerome H. Saltzer , David P. Reed , David D. Clark

article Free Access Share on End-to-end arguments in system design Authors: J. H. Saltzer M.I.T. Laboratory for Computer Science, 545 Technology Square, Cambridge, MA M.I.T. Lab...

2009 2100 citations

Trading MIPS and memory for knowledge engineering

Robert H. Creecy , Brij Masand , Stephen J Smith +1 more

article Free Access Share on Trading MIPS and memory for knowledge engineering Authors: Robert H. Creecy U.S. Bureau of the Census, Washington, DC U.S. Bureau of the Census, Was...

1992 Communications of the ACM 180 citations

Using mappings to prove timing properties

Nancy Lynch , Hagit Attiya

Article Free Access Share on Using mappings to prove timing properties Authors: Nancy Lynch Laboratory for Computer Science, MIT, Cambridge, MA Laboratory for Computer Science, ...

1990 Proceedings of the ninth annual ACM s... 45 citations

Bounded-width polynomial-size branching programs recognize exactly those languages in <i>NC</i><sup>1</sup>

David A. Mix Barrington

Article Bounded-width polynomial-size branching programs recognize exactly those languages in NC1 Share on Author: D A Barrington Department of Mathematics, Massachusetts Instit...

1986 681 citations

Publication Info

Year: 1960
Type: article
Volume: 3
Issue: 9
Pages: 490-499
Citations: 1076
Access: Closed

External Links

View on DOI.org

Social Impact

Altmetric

Trie memory

PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

1076

OpenAlex

Cite This

APA Style

                            
                                    Edward Fredkin
                                
                            (1960). 
                            Trie memory. 
                            Communications of the ACM
                            , 3
                            (9)
                            , 490-499.
                            https://doi.org/10.1145/367390.367400

Identifiers

DOI: 10.1145/367390.367400