Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 753968

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

zbMATH Open0817.68068MaRDI QIDQ4698689FDOQ4698689


Authors: Eric Schenk Edit this on Wikidata


Publication date: 6 August 1995



Title of this publication is not available (Why is that?)



Recommendations

  • Parallel dynamic lowest common ancestors
  • Finding Lowest Common Ancestors in Parallel
  • scientific article; zbMATH DE number 4064469
  • On Finding Lowest Common Ancestors: Simplification and Parallelization
  • A fast cost-optimal parallel algorithm for the lowest common ancestor problem


zbMATH Keywords

lowest common ancestors


Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05) Parallel algorithms in computer science (68W10)



Cited In (8)

  • On Finding Lowest Common Ancestors: Simplification and Parallelization
  • A fast cost-optimal parallel algorithm for the lowest common ancestor problem
  • Parallel dynamic lowest common ancestors
  • Finding Lowest Common Ancestors in Parallel
  • Simple parallel algorithms for dynamic range products
  • Recursive Star-Tree Parallel Data Structure
  • Title not available (Why is that?)
  • Title not available (Why is that?)





This page was built for publication:

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4698689&oldid=18935124"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 19:44. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki