Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Bit serial addition trees and their applications

From MaRDI portal
Publication:1099602
Jump to:navigation, search

DOI10.1007/BF02242186zbMath0638.68009OpenAlexW11522892MaRDI QIDQ1099602

Selim G. Akl, Henk G. Meijer

Publication date: 1988

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02242186


zbMATH Keywords

Parallel algorithmslogical circuit


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of software (68N99)


Related Items (1)

Finding the closest extreme vertex to a fixed point




Cites Work

  • Efficient selection on a binary tree
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Bit serial addition trees and their applications

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1099602&oldid=13136485"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 01:39.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki