default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Systems Theory, Volume 28
Volume 28, January/February 1995
- Prabhakar Raghavan
:
Robust Algorithms for Packet Routing in a Mesh. 1-11 - Josep Rifà, Joan Borrell:
A Fast Algorithm To Compute Irreducible and Primitive Polynomials in Finite Fields. 13-20 - Christoph Meinel, Stephan Waack:
Separating Complexity Classes Related to Bounded Alternating \omega-Branching Programs. 21-39 - Igor Litovsky, Yves Métivier, Éric Sopena:
Different Local Controls for Graph Relabeling Systems. 41-65 - Hubert Comon:
On Unification of Terms with Integer Exponents. 67-88
Volume 28, Number 2, March/April 1995
- Alberto Apostolico, Maxime Crochemore:
Fast Parallel Lyndon Factorization with Applications. 89-108 - Jie Wang:
Productive Functions and Isomorphisms. 109-116 - Carme Àlvarez, José L. Balcázar, Birgit Jenner:
Adaptive Logspace Reducibility and Parallel Time. 117-140 - Jyrki Kivinen:
Learning Reliably and with One-Sided Error. 141-172
Volume 28, Number 3, May/June 1995
- Richard Chang, Jim Kadin:
On Computing Boolean Connectives of Characteristic Functions. 173-198 - Michael A. Palis, Sunil M. Shende:
Pumping Lemmas for the Control Language Hierarchy. 199-213 - Jeff I. Chu, Georg Schnitger:
Communication Complexity of Matrix Computation over Finite Fields. 215-228 - Kenneth W. Regan, James S. Royer:
On Closure Properties of Bounded Two-Sided Error Complexity Classes. 229-243 - Emanuela Fachini, Jozef Gruska, Margherita Napoli, Domenico Parente:
Power of Interconnections and of Nondeterminism in Regular Y-Tree Systolic Automata. 245-266 - Sanjay Jain, Arun Sharma:
Prudence in Vacillatory Language Identification. 267-279
Volume 28, Number 4, July/August 1995
- Frederic Green:
A Lower Bound for Monotone Perceptrons. 283-298 - Timothy J. Long, Ming-Jye Sheu:
A Refinement of the Low and High Hierarchies. 299-327 - Maciej Liskiewicz:
On the Power of 1-Tape Off-Line ATMs Running in a Bounded Number of Reversals. 329-339 - Celia Wrathall, Volker Diekert:
On Confluence of One-Rule Trace-Rewriting Systems. 341-361 - Friedrich Otto:
On Confluence Versus Strong Confluence for One-Rule Trace-Rewriting Systems. 363-384
Volume 28, Number 5, September/October 1995
- Franz Aurenhammer, Johann Hagauer:
Recognizing Binary Hamming Graphs in O(n² log n) Time. 387-395 - Christian Choffrut, Leucio Guerra:
Logical Definability of Some Rational Trace Languages. 397-420 - Shimon Even, Sergio Rajsbaum:
Unison, Canon, and Sluggish Clocks in Networks Controlled by a Synchronizer. 421-435 - Christian Choffrut, Massimiliano Goldwurm:
Rational Transductions and Complexity of Counting Problems. 437-450 - Jeffery R. Westbrook, Dicky C. K. Yan:
The Performance of Greedy Algorithms for the On-Line Steiner Tree and Related Problems. 451-468 - Amos Israeli, Amnon Shaham, Asaf Shirazi:
Linear-Time Snapshot Implementations in Unbalanced Systems. 469-486
Volume 28, Number 6, November/December 1995
- William I. Gasarch, Mark W. Krentel, Kevin J. Rappoport:
OptP as the Normal Behavior of NP-Complete Problems. Math. Syst. Theory 28(6): 487-514 (1995) - Bruno Courcelle, Joost Engelfriet:
A Logical Characterization of the Sets of Hypergraphs Defined by Hyperedge Replacement Grammars. Math. Syst. Theory 28(6): 515-552 (1995) - Matthias Krause, Stephan Waack:
Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two Circuits Having Nearly Symmetric Gates with Unbounded Fan-In. Math. Syst. Theory 28(6): 553-564 (1995)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-14 22:38 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
