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

Parallel tree pattern matching

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

DOI10.1016/S0747-7171(08)80023-5zbMath0698.68033MaRDI QIDQ912610

N. E. Zubov

Publication date: 1990

Published in: Journal of Symbolic Computation (Search for Journal in Brave)


zbMATH Keywords

parallel algorithmpattern matchingCREW PRAMEREW PRAMparallel random access machine


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)


Related Items (1)

On Synchronizing Tree Automata and Their Work–Optimal Parallel Run, Usable for Parallel Tree Pattern Matching




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Efficient parallel algorithms for graph problems
  • Optimal parallel algorithms for string matching
  • Optimal parallel pattern matching in strings
  • Pattern Matching in Trees
  • Abstract data types and software validation
  • Term matching on parallel computers
  • The Parallel Evaluation of General Arithmetic Expressions
  • Parallelism in random access machines




This page was built for publication: Parallel tree pattern matching

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