Pages that link to "Item:Q2542990"
From MaRDI portal
The following pages link to On the computational power of pushdown automata (Q2542990):
Displaying 50 items.
- On the cost of searching signature trees (Q845663) (← links)
- Dynamic maintenance of directed hypergraphs (Q913481) (← links)
- Communication complexity of PRAMs (Q913504) (← links)
- A complexity theory of efficient parallel algorithms (Q913512) (← links)
- An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree (Q924878) (← links)
- An efficient automata approach to some problems on context-free grammars. (Q930285) (← links)
- The unpredictable deviousness of models (Q959796) (← links)
- Efficient heuristic algorithms for path-based hardware/software partitioning (Q988463) (← links)
- Open problems in computational linear algebra (Q999481) (← links)
- On limits on the computational power of data-accumulating algorithms (Q1007605) (← links)
- Optimal state-space lumping in Markov chains (Q1014448) (← links)
- Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation (Q1041762) (← links)
- An \(O(n^{3}\log \log n/\log n)\) time algorithm for the all-pairs shortest path problem (Q1044727) (← links)
- Two flow network simplification algorithms (Q1045934) (← links)
- Computational experience with minimum spanning tree algorithms (Q1053620) (← links)
- Embeddings of binary trees in lines (Q1058856) (← links)
- An algorithm for identifying Morishima and anti-Morishima matrices and balanced digraphs (Q1059646) (← links)
- Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra (Q1060232) (← links)
- An approach to the subgraph homeomorphism problem (Q1062457) (← links)
- Multiplication is the easiest nontrivial arithmetic function (Q1066671) (← links)
- On efficient recognition of transductions and relations (Q1066679) (← links)
- Computing in general Abelian groups is hard (Q1070820) (← links)
- Quasi-gcd computations (Q1071503) (← links)
- Complexity results on the conjugacy problem for monoids (Q1073015) (← links)
- Molecular dynamics on vector computers (Q1073533) (← links)
- System structure: stability and controllability (Q1078524) (← links)
- Efficient string matching with k mismatches (Q1079377) (← links)
- Richard Bellman's contributions to computer science (Q1081590) (← links)
- On the construction of parallel computers from various basis of Boolean functions (Q1083204) (← links)
- The principle of optimality in the design of efficient algorithms (Q1085609) (← links)
- Computing a ham-sandwich cut in two dimensions (Q1091824) (← links)
- Polynomial division and its computational complexity (Q1094135) (← links)
- An O(m n) algorithm for regular set-covering problems (Q1095668) (← links)
- Scheduling with semaphore constraints (Q1096534) (← links)
- Amortized efficiency of a path retrieval data structure (Q1099629) (← links)
- Parameter-reduction of higher level grammars (Q1099634) (← links)
- Complexity of parallel matrix computations (Q1100892) (← links)
- Recognizing max-flow min-cut path matrices (Q1103514) (← links)
- A fast algorithm for the discrete Laplace transformation (Q1104064) (← links)
- A multiprocessor architecture for solving nonlinear partial differential equations (Q1118368) (← links)
- Worst-case analysis of the set-union problem with extended backtracking (Q1124334) (← links)
- Total domination in block graphs (Q1124531) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- The suffix tree of a tree and minimizing sequential transducers (Q1127317) (← links)
- Data representation and computational complexity (Q1132872) (← links)
- Fast verification, testing, and generation of large primes (Q1132906) (← links)
- Uniform data encodings (Q1134520) (← links)
- Complexity of Boolean algebras (Q1137036) (← links)
- Complexity of dimension three and some related edge-covering characteristics of graphs (Q1143791) (← links)
- On evaluating strategies for the computation of DWBA integrals (Q1151229) (← links)
