A Generalized Dictionary Machine for VLSI

DOI10.1109/TC.1985.1676551MaRDI QIDQ3219100zbMATH OpenOpenAlexFDO

Authors S. R. Kosaraju, Mikhail J. Atallah

Publication date 1985

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1985.1676551

zbMATH Keywords

binary treedata queriesdictionaryparallel processingpipeliningpriority queuetree machineVLSI

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Recommendations

• An efficient in-place VLSI architecture for Viterbi algorithm
• scientific article; zbMATH DE number 48258
• scientific article; zbMATH DE number 4080954
• A vector quantization algorithm suitable for VLSI implementation
• Solving VLSI physical design problems on a vector machine
• scientific article; zbMATH DE number 3954290

Cited in

(5)

• Optimal parallel algorithms for constructing and maintaining a balanced m-way search tree
• Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs
• A design of a parallel dictionary using skip lists
• Iterative tree arrays with logarithmic depth^†
• Dictionary Machine with Improved Performance

This page was built for publication: A Generalized Dictionary Machine for VLSI

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3219100)