Almost fully-parallel parentheses matching

Omer Berkman; Uzi Vishkin

doi:10.1016/0166-218x(93)e0137-n

ScienceGate Book Chapters

JOURNAL ARTICLE

Almost fully-parallel parentheses matching

Omer Berkman Uzi Vishkin

Year: 1995 Journal: Discrete Applied Mathematics Vol: 57 (1)Pages: 11-28 Publisher: Elsevier BV

DOI: 10.1016/0166-218x(93)e0137-n

Get Full-Text PDF Get Analytical Report

Keywords:

Ackermann function Parenthesis Mathematics Combinatorics Matching (statistics) Inverse Sequence (biology) Function (biology) Generating function Discrete mathematics Algorithm Geometry

Metrics

Cited By

0.14

FWCI (Field Weighted Citation Impact)

Refs

0.41

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

DNA and Biological Computing

Life Sciences → Biochemistry, Genetics and Molecular Biology → Molecular Biology

Graph Theory and Algorithms

Physical Sciences → Computer Science → Computer Vision and Pattern Recognition

Algorithms and Data Compression

Physical Sciences → Computer Science → Artificial Intelligence

Almost fully-parallel parentheses matching

Metrics

Citation History

Topics

Related Documents

Matching parentheses in parallel

Some fast parallel algorithms for parentheses matching

Communication-Efficient Bulk Synchronous Parallel Algorithm for Parentheses Matching.

A new parallel algorithm for the parentheses-matching problem

Almost-optimal fully LZW-compressed pattern matching