On the public citation graph

An efficient digital search algorithm by using a double-array structure

0 signed · 154 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1038/scientificamerican0984-60openalex-snapshot
Data Structures and Algorithms
inferredcites →https://doi.org/10.1080/00207168208803329openalex-snapshot
A practical method for reducing sparse matrices with invariant entries
inferredcites →https://doi.org/10.1093/comjnl/28.1.54openalex-snapshot
Practical Perfect Hashing
inferredcites →https://doi.org/10.1109/32.31357openalex-snapshot
An efficient implementation of static string pattern matching machines
inferredcites →https://doi.org/10.1109/cmpsac.1988.17222openalex-snapshot
An efficient digital search algorithm by using a double-array structure
inferredcites →https://doi.org/10.1109/tse.1983.236167openalex-snapshot
A Practical Method for Reducing Weak Precedence Parsers
inferredcites →https://doi.org/10.1109/tse.1984.5010205openalex-snapshot
A Method for Improving String Pattern Matching Machines
inferredcites →https://doi.org/10.1109/tse.1987.233491openalex-snapshot
Two Access Methods Using Compact Binary Trees
inferredcites →https://doi.org/10.1137/0215044openalex-snapshot
Collections of Functions for Perfect Hashing
inferredcites →https://doi.org/10.1142/9789812791245openalex-snapshot
Data Structures and Algorithms
inferredcites →https://doi.org/10.1145/320083.320092openalex-snapshot
Extendible hashing—a fast access method for dynamic files
inferredcites →https://doi.org/10.1145/358800.358806openalex-snapshot
Reciprocal hashing
inferredcites →https://doi.org/10.1145/358808.358813openalex-snapshot
Minimal perfect hash functions made simple
inferredcites →https://doi.org/10.1145/359168.359175openalex-snapshot
Storing a sparse table
inferredcites →https://doi.org/10.1145/359642.359653openalex-snapshot
Median split trees
inferredcites →https://doi.org/10.1145/359863.359887openalex-snapshot
Perfect hashing functions
inferredcites →https://doi.org/10.1145/360248.360258openalex-snapshot
Compressed tries
inferredcites →https://doi.org/10.1145/360825.360855openalex-snapshot
Efficient string matching
inferredcites →https://doi.org/10.1145/367390.367400openalex-snapshot
Trie memory
inferredcites →https://doi.org/10.1145/828.1884openalex-snapshot
Storing a Sparse Table with 0 (1) Worst Case Access Time

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/1097-024x(200101)31:1<43::aid-spe356>3.0.co;2-ropenalex-snapshot
Fast insertion methods of a double‐array structure
inferred← citeshttps://doi.org/10.1002/cpe.3940openalex-snapshot
RICS‐DFA: a space and time‐efficient signature matching algorithm with Reduced Input Character Set
inferred← citeshttps://doi.org/10.1002/scj.10481openalex-snapshot
A retrieval method of a double array in secondary storage
inferred← citeshttps://doi.org/10.1002/scj.4690200710openalex-snapshot
A fast digital search algorithm using a double‐array structure
inferred← citeshttps://doi.org/10.1002/sec.1115openalex-snapshot
An efficient parallel algorithm for exact multi‐pattern matching
inferred← citeshttps://doi.org/10.1002/spe.2516openalex-snapshot
Practical rearrangement methods for dynamic double‐array dictionaries
inferred← citeshttps://doi.org/10.1002/spe.3190openalex-snapshot
Engineering faster double‐array Aho–Corasick automata
inferred← citeshttps://doi.org/10.1002/spe.4380240303openalex-snapshot
A method of compressing trie structures
inferred← citeshttps://doi.org/10.1002/spe.545openalex-snapshot
A fast and compact elimination method of empty elements from a double‐array structure
inferred← citeshttps://doi.org/10.1002/spe.778openalex-snapshot
An efficient deletion method for a minimal prefix double array
inferred← citeshttps://doi.org/10.1002/spe.v37:5openalex-snapshot
inferred← citeshttps://doi.org/10.1007/11554028_85openalex-snapshot
A New Technique of Determining Speaker’s Intention for Sentences in Conversation
inferred← citeshttps://doi.org/10.1007/3-540-44686-9_36openalex-snapshot
A Method of Pre-computing Connectivity Relations for Japanese/Korean POS Tagging
inferred← citeshttps://doi.org/10.1007/978-3-031-82697-9_21openalex-snapshot
Packed Acyclic Deterministic Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-57529-2_21openalex-snapshot
Efficient Training of Adaptive Regularization of Weight Vectors for Semi-structured Text
inferred← citeshttps://doi.org/10.1007/978-3-540-30132-5_76openalex-snapshot
A New Method of Detecting Time Expressions for E-mail Messages
inferred← citeshttps://doi.org/10.1007/978-3-540-30132-5_77openalex-snapshot
A New Classification Method of Determining the Speaker’s Intention for Sentences in Conversation
inferred← citeshttps://doi.org/10.1007/978-3-540-30132-5_79openalex-snapshot
A Method of Extracting and Evaluating Popularity and Unpopularity for Natural Language Expressions
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_35openalex-snapshot
Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
inferred← citeshttps://doi.org/10.1007/978-3-540-77094-7_53openalex-snapshot
An Efficient Dictionary Mechanism Based on Double-Byte
inferred← citeshttps://doi.org/10.1007/978-3-642-04592-9_39openalex-snapshot
Intelligent QA Systems Using Semantic Expressions
inferred← citeshttps://doi.org/10.1007/978-3-642-29253-8_20openalex-snapshot
A GPU-Based Accelerator for Chinese Word Segmentation
inferred← citeshttps://doi.org/10.1007/978-3-642-35795-4_72openalex-snapshot
Speeding Up Double-Array Trie Construction for String Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-41674-3_122openalex-snapshot
A Multi-pattern Matching Algorithm Based on Double Array Trie
inferred← citeshttps://doi.org/10.1007/978-3-662-48683-2_23openalex-snapshot
RICS-DFA: Reduced Input Character Set DFA for Memory-Efficient Regular Expression Matching
inferred← citeshttps://doi.org/10.1007/s00224-026-10262-1openalex-snapshot
NP-Completeness on the Length of Double-Arrays and the Sparse Matrix Problem with at Least Logarithmic Alphabets/Widths
inferred← citeshttps://doi.org/10.1007/s00453-021-00869-wopenalex-snapshot
Top Tree Compression of Tries
inferred← citeshttps://doi.org/10.1007/s00778-019-00595-4openalex-snapshot
Efficient query autocompletion with edit distance-based error tolerance
inferred← citeshttps://doi.org/10.1007/s10115-015-0873-0openalex-snapshot
A compression method of double-array structures using linear functions
inferred← citeshttps://doi.org/10.1007/s10115-016-0999-8openalex-snapshot
Compressed double-array tries for string dictionaries supporting fast lookup
inferred← citeshttps://doi.org/10.1016/0020-0255(95)00095-xopenalex-snapshot
A method for the expansion and contraction of text's size by using the string replacement algorithm
inferred← citeshttps://doi.org/10.1016/b978-012373591-1/50002-4openalex-snapshot
Language Models for Text Entry
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104794openalex-snapshot
c-trie++: A dynamic trie tailored for fast prefix searches
inferred← citeshttps://doi.org/10.1016/j.ins.2003.07.018openalex-snapshot
A compression algorithm using integrated record information for translation dictionaries
inferred← citeshttps://doi.org/10.1016/j.ins.2003.12.003openalex-snapshot
An efficient e-mail filtering using time priority measurement
inferred← citeshttps://doi.org/10.1016/j.ipm.2006.04.004openalex-snapshot
A compact static double-array keeping character codes
inferred← citeshttps://doi.org/10.1016/j.ipm.2009.08.004openalex-snapshot
New methods for compression of MP double array by compact management of suffixes
inferred← citeshttps://doi.org/10.1016/j.ipm.2014.04.004openalex-snapshot
Compression of double array structures for fixed length keywords
inferred← citeshttps://doi.org/10.1016/j.ipm.2024.103812openalex-snapshot
Chinese nested entity recognition method for the finance domain based on heterogeneous graph network
inferred← citeshttps://doi.org/10.1016/j.jbi.2004.08.001openalex-snapshot
Use of morphological analysis in protein name recognition
inferred← citeshttps://doi.org/10.1016/s0020-0255(00)00061-xopenalex-snapshot
An efficient representation for implementing finite state machines based on the double-array
inferred← citeshttps://doi.org/10.1016/s0020-0255(03)00189-0openalex-snapshot
Fast and compact updating algorithms of a double-array structure
inferred← citeshttps://doi.org/10.1016/s0020-0255(98)00009-7openalex-snapshot
A fast algorithm of retrieving common sentences
inferred← citeshttps://doi.org/10.1016/s0306-4573(01)00031-0openalex-snapshot
A dynamic construction algorithm for the Compact Patricia trie using the hierarchical structure
inferred← citeshttps://doi.org/10.1016/s0306-4573(02)00090-0openalex-snapshot
An improvement key deletion method for double-array structure using single-nodes
inferred← citeshttps://doi.org/10.1016/s0306-4573(98)00036-3openalex-snapshot
A fast retrieving algorithm of hierarchical relationships using trie structures
inferred← citeshttps://doi.org/10.1016/s0306-4573(99)00035-7openalex-snapshot
Two improved access methods on compact binary (CB) trees
inferred← citeshttps://doi.org/10.1080/00207160211286openalex-snapshot
An Efficient Trie Construction for Natural Language Dictionaries
inferred← citeshttps://doi.org/10.1080/00207160410001714600openalex-snapshot
A new compression method of double array for compact dictionaries
inferred← citeshttps://doi.org/10.1080/00207160412331336071openalex-snapshot
A sentence classification technique using intention association expressions
inferred← citeshttps://doi.org/10.1080/00207169508804432openalex-snapshot
An incremental algorithm for string pattern matching machines
inferred← citeshttps://doi.org/10.1080/00207169808804622openalex-snapshot
Efficient multi-attribute pattern matching
inferred← citeshttps://doi.org/10.1080/00207169808804680openalex-snapshot
An efficient algorithm for retrieving example sentences
inferred← citeshttps://doi.org/10.1080/00207169908804869openalex-snapshot
A link trie structure of storing multiple attribute relationships for natural language dictionaries
inferred← citeshttps://doi.org/10.1109/69.506713openalex-snapshot
A trie compaction algorithm for a large set of keys
inferred← citeshttps://doi.org/10.1109/aina.2017.30openalex-snapshot
A Compact-Trie-Based Structure for K-Nearest-Neighbour Searching
inferred← citeshttps://doi.org/10.1109/cscwd.2010.5471891openalex-snapshot
A method for large cross-language lexicon management based on collaborative work of hash family and double-array trie
inferred← citeshttps://doi.org/10.1109/dcc.1991.213323openalex-snapshot
Keyword dictionary compression using efficient trie implementation
inferred← citeshttps://doi.org/10.1109/dcc47342.2020.00032openalex-snapshot
c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches
inferred← citeshttps://doi.org/10.1109/grc.2011.6122567openalex-snapshot
An efficient algorithm for constructing a Sequence Binary Decision Diagram representing a set of reversed sequences
inferred← citeshttps://doi.org/10.1109/iacs.2014.6841955openalex-snapshot
A fast and compact hybrid memory resident datastore for text analytics with autonomic memory allocation
inferred← citeshttps://doi.org/10.1109/iccea.2010.64openalex-snapshot
Customized Tries for Weighted Key Completion
inferred← citeshttps://doi.org/10.1109/iccnc.2013.6504109openalex-snapshot
TFD: A multi-pattern matching algorithm for large-scale URL filtering
inferred← citeshttps://doi.org/10.1109/icicta.2009.755openalex-snapshot
Comparative Study on the Double-Array Structure for Large English & Chinese Lexicons
inferred← citeshttps://doi.org/10.1109/icips.1997.669112openalex-snapshot
Rules for describing multi-attribute information and its efficient pattern matching
inferred← citeshttps://doi.org/10.1109/icoci.2006.5276476openalex-snapshot
Double-array compression by pruning twin leaves and unifying common suffixes
inferred← citeshttps://doi.org/10.1109/icoci.2006.5276556openalex-snapshot
A compression method using link-trie structure for natural language dictionaries
inferred← citeshttps://doi.org/10.1109/icpads.1994.590369openalex-snapshot
Parallel implementation of the trie structure
inferred← citeshttps://doi.org/10.1109/icsmc.1995.538341openalex-snapshot
A hierarchical clustering strategy for very large fuzzy databases
inferred← citeshttps://doi.org/10.1109/icsmc.1996.565498openalex-snapshot
A compact and fast structure for trie retrieval algorithms
inferred← citeshttps://doi.org/10.1109/icsmc.1996.569735openalex-snapshot
The construction of knowledge bases with morphological semantics
inferred← citeshttps://doi.org/10.1109/icsmc.1998.725084openalex-snapshot
A fast and compact data structure of storing multi-attribute relations among words
inferred← citeshttps://doi.org/10.1109/icsmc.1998.727572openalex-snapshot
An efficient retrieval algorithm for case structures using TRIE
inferred← citeshttps://doi.org/10.1109/icsmc.1998.727573openalex-snapshot
A multi-stage retrieval algorithm for postings on index tables
inferred← citeshttps://doi.org/10.1109/icsmc.2001.969862openalex-snapshot
Implementation of update algorithms for a double-array structure
inferred← citeshttps://doi.org/10.1109/icsmc.2001.969863openalex-snapshot
On the construction of reduced double array structures by dividing tries
inferred← citeshttps://doi.org/10.1109/icsmc.2002.1173350openalex-snapshot
A new compact deletion algorithm for double-array structures
inferred← citeshttps://doi.org/10.1109/icsmc.2002.1173351openalex-snapshot
A fast attribute matching algorithm of case structures using trie structures
inferred← citeshttps://doi.org/10.1109/icsmc.2002.1173352openalex-snapshot
A compression algorithm using integrated record information for translation dictionaries
inferred← citeshttps://doi.org/10.1109/icycs.2008.28openalex-snapshot
Efficient Top-k Keyword Search on XML Streams
inferred← citeshttps://doi.org/10.1109/ihmsc.2016.61openalex-snapshot
Implementation of a Chinese Word Segmentation in Big Data Environment
inferred← citeshttps://doi.org/10.1109/innovate-data.2017.9openalex-snapshot
Practical String Dictionary Compression Using String Dictionary Encoding
inferred← citeshttps://doi.org/10.1109/innovations.2008.4781726openalex-snapshot
Fast string matching with space-efficient word graphs
inferred← citeshttps://doi.org/10.1109/iscc.2004.1358388openalex-snapshot
A new classification sentence technique using intension expressions
inferred← citeshttps://doi.org/10.1109/iscc.2004.1358392openalex-snapshot
An new E-mail filtering technique using time priority measurement
inferred← citeshttps://doi.org/10.1109/itcc.2005.261openalex-snapshot
Stateful Inspection firewall session table processing
inferred← citeshttps://doi.org/10.1109/iwcia.2015.7449451openalex-snapshot
Trie compact representation using double-array structures with string labels
inferred← citeshttps://doi.org/10.1109/ssme.2009.42openalex-snapshot
The Research and Implement of an Efficient Load Balancing Algorithm
inferred← citeshttps://doi.org/10.1109/waim.2008.80openalex-snapshot
Accelerating Multiple String Matching by Using Cache-Efficient Strategy
inferred← citeshttps://doi.org/10.1111/1365-2664.14356openalex-snapshot
Boosting propagule transport models with individual‐specific data from mobile apps
inferred← citeshttps://doi.org/10.1142/s0129054118430025openalex-snapshot
m-Bonsai: A Practical Compact Dynamic Trie
inferred← citeshttps://doi.org/10.1142/s0219622005001477openalex-snapshot
A METHOD OF EXTRACTING AND EVALUATING GOOD AND BAD REPUTATIONS FOR NATURAL LANGUAGE EXPRESSIONS
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
inferred← citeshttps://doi.org/10.1145/2873068openalex-snapshot
A Fast and Compact Language Model Implementation Using Double-Array Structures
inferred← citeshttps://doi.org/10.1145/3418033openalex-snapshot
Dynamic Path-decomposed Tries
inferred← citeshttps://doi.org/10.1145/3594315.3594361openalex-snapshot
An Improved Quad-Array Trie Algorithm for Website Sensitive Word Detection
inferred← citeshttps://doi.org/10.1145/3770855.3818506openalex-snapshot
Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators
inferred← citeshttps://doi.org/10.1145/378881.378887openalex-snapshot
A method for building knowledge bases with morphological semantics
inferred← citeshttps://doi.org/10.1186/1471-2105-9-s11-s5openalex-snapshot
How to make the most of NE dictionaries in statistical NER
inferred← citeshttps://doi.org/10.1371/journal.pone.0215288openalex-snapshot
MergedTrie: Efficient textual indexing
inferred← citeshttps://doi.org/10.14569/ijacsa.2016.070704openalex-snapshot
A New Method to Build NLP Knowledge for Improving Term Disambiguation
inferred← citeshttps://doi.org/10.14778/2536336.2536339openalex-snapshot
Efficient error-tolerant query autocompletion
inferred← citeshttps://doi.org/10.1504/ijcat.2008.019491openalex-snapshot
Estimation of FAQ knowledge bases by using semantic expressions for questions and answers
inferred← citeshttps://doi.org/10.1504/ijcat.2008.021942openalex-snapshot
A method of reduction e-mails using replacement and repression
inferred← citeshttps://doi.org/10.1504/ijcat.2009.023615openalex-snapshot
A compressed trie structure using divided keys
inferred← citeshttps://doi.org/10.1504/ijcat.2013.056019openalex-snapshot
Effectiveness of an implementation method for retrieving similar strings by trie structures
inferred← citeshttps://doi.org/10.1504/ijcat.2015.071971openalex-snapshot
Double array structures based on byte segmentation for n-gram
inferred← citeshttps://doi.org/10.1504/ijista.2015.074331openalex-snapshot
A new compression method for double-array structures by a hierarchical representation
inferred← citeshttps://doi.org/10.1504/ijista.2015.074336openalex-snapshot
A construction method by divided double array structures
inferred← citeshttps://doi.org/10.17706//jsw.10.6.739-747openalex-snapshot
Experimental Observations of Construction Methods for Double Array Structures Using Linear Functions
inferred← citeshttps://doi.org/10.18178/ijfcc.2016.5.6.476openalex-snapshot
An Implementation Method of Trie Structure Using Xorshift
inferred← citeshttps://doi.org/10.18178/ijfcc.2016.5.6.478openalex-snapshot
Full-Text Search Using Double-Array CDAWG
inferred← citeshttps://doi.org/10.18653/v1/2023.acl-short.2openalex-snapshot
Back to Patterns: Efficient Japanese Morphological Analysis with Feature-Sequence Trie
inferred← citeshttps://doi.org/10.18653/v1/d13-1023openalex-snapshot
An Efficient Language Model Using Double-Array Structures
inferred← citeshttps://doi.org/10.18653/v1/p17-1149openalex-snapshot
Bridge Text and Knowledge by Learning Multi-Prototype Entity Mention Embedding
inferred← citeshttps://doi.org/10.2197/ipsjjip.20.228openalex-snapshot
Efficient Classification with Conjunctive Features
inferred← citeshttps://doi.org/10.23940/ijpe.18.04.p7.647655openalex-snapshot
Collision Analysis and an Efficient Double Array Construction Method
inferred← citeshttps://doi.org/10.23940/ijpe.19.04.p20.12471254openalex-snapshot
Compression Method of Factor Oracle by Triple-Array Structures
inferred← citeshttps://doi.org/10.2991/nceece-15.2016.190openalex-snapshot
A Novel Protocol Fuzz Testing Approach
inferred← citeshttps://doi.org/10.3115/1075096.1075100openalex-snapshot
Fast methods for kernel-based text analysis
inferred← citeshttps://doi.org/10.3115/1118905.1118919openalex-snapshot
Learning sequence-to-sequence correspondences from parallel corpora via sequential pattern mining
inferred← citeshttps://doi.org/10.3115/1572306.1572318openalex-snapshot
How to make the most of NE dictionaries in statistical NER
inferred← citeshttps://doi.org/10.3115/1699648.1699701openalex-snapshot
Polynomial to linear
inferred← citeshttps://doi.org/10.3115/v1/e14-4016openalex-snapshot
Deterministic Word Segmentation Using Maximum Matching with Fully Lexicalized Rules
inferred← citeshttps://doi.org/10.3233/978-1-61499-419-0-1085openalex-snapshot
An Approximate Counting for Big Textual Data Streams
inferred← citeshttps://doi.org/10.3390/app10155266openalex-snapshot
An Efficient Two-Level-Partitioning-Based Double Array and Its Parallelization
inferred← citeshttps://doi.org/10.3390/app10238530openalex-snapshot
Ext-LOUDS: A Space Efficient Extended LOUDS Index for Superset Query
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.108-111.1049openalex-snapshot
The Research and Implementation of NaXi Pictographs Mobile Phone Dictionary Based on J2ME
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.846-847.1326openalex-snapshot
Recursive Enumeration K-Best Decoding Algorithm in Chinese Input Method Application
inferred← citeshttps://doi.org/10.5070/h915130064openalex-snapshot
Research on Tibetan Semantic Role Labeling using an Integrated Strategy
inferred← citeshttps://doi.org/10.5070/h915130103openalex-snapshot
A Chinese to Tibetan Machine Translation System with Multiple Translating Strategies
inferred← citeshttps://doi.org/10.5762/kais.2009.10.8.1986openalex-snapshot
Searching for Variants Using Trie-Index
inferred← citeshttps://doi.org/10.7763/ijcte.2014.v6.855openalex-snapshot
A Retrieval Method for Double Array Structures by Using Byte N-Gram
inferred← citeshttps://doi.org/10.7763/ijcte.2016.v8.1018openalex-snapshot
Comparisons of Efficient Implementations for DAWG
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.