The following pages link to STACS 92 (Q5096764):
Displayed 47 items.
- Structuring and modularizing algebraic specifications: the PLUSS specification language, evolutions and perspectives (Q5096765) (← links)
- The parallel complexity of tree embedding problems (extended abstract) (Q5096766) (← links)
- A theory of strict P-completeness (Q5096767) (← links)
- Fast and optimal simulations between CRCW PRAMs (Q5096768) (← links)
- Suitability of the propositional temporal logic to express properties of real-time systems (Q5096770) (← links)
- Axiomatizations of backtracking (Q5096771) (← links)
- Joining k- and l-recognizable sets of natural numbers (Q5096772) (← links)
- On the performance of networks with multiple busses (Q5096774) (← links)
- Efficient algorithms for solving systems of linear equations and path problems (Q5096775) (← links)
- Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition (Q5096776) (← links)
- A simplified technique for hidden-line elimination in terrains (Q5096777) (← links)
- A competitive analysis of nearest neighbor based algorithms for searching unknown scenes (Q5096778) (← links)
- Equality and disequality constraints on direct subterms in tree automata (Q5096779) (← links)
- Deterministic regular languages (Q5096780) (← links)
- The extended low hierarchy is an infinite hierarchy (Q5096781) (← links)
- Locally definable acceptance types for polynomial time machines (Q5096782) (← links)
- The theory of the polynomial many-one degrees of recursive sets is undecidable (Q5096783) (← links)
- A plane-sweep algorithm for finding a closest pair among convex planar objects (Q5096784) (← links)
- Linear approximation of simple objects (Q5096785) (← links)
- Language learning without overgeneralization (Q5096786) (← links)
- The log-star revolution (Q5096787) (← links)
- Separating counting communication complexity classes (Q5096788) (← links)
- A nonlinear lower bound on the practical combinational complexity (Q5096789) (← links)
- Characterizations of some complexity classes between Θ2p and Δ2p (Q5096790) (← links)
- On complexity classes and algorithmically random languages (Q5096791) (← links)
- New time hierarchy results for deterministic TMS (Q5096792) (← links)
- Unconditional Byzantine agreement for any number of faulty processors (Q5096793) (← links)
- Broadcasting in butterfly and debruijn networks (Q5096794) (← links)
- Interval approximations of message causality in distributed executions (Q5096795) (← links)
- On the approximability of the maximum common subgraph problem (Q5096796) (← links)
- The complexity of colouring circle graphs (Q5096797) (← links)
- Graph isomorphism is low for PP (Q5096798) (← links)
- A simple linear time algorithm for triangulating three-colored graphs (Q5096799) (← links)
- On locally optimal alignments in genetic sequences (Q5096800) (← links)
- Secure commitment against a powerful adversary (Q5096801) (← links)
- Communication efficient Zero-knowledge Proofs of knowledge (Q5096802) (← links)
- Four results on randomized incremental constructions (Q5096803) (← links)
- Enclosing many boxes by an optimal pair of boxes (Q5096804) (← links)
- Performance driven k-layer wiring (Q5096805) (← links)
- Synthesis for testability: Binary Decision Diagrams (Q5096806) (← links)
- Compression and entropy (Q5096807) (← links)
- Iterative devices generating infinite words (Q5096808) (← links)
- On the factorization conjecture (Q5096809) (← links)
- Conditional semi-Thue systems for presenting monoids (Q5096810) (← links)
- A combinatorial bound for linear programming and related problems (Q5096811) (← links)
- In-place linear probing sort (Q5096812) (← links)
- Speeding up two string-matching algorithms (Q5096813) (← links)