Category:LNCS 1046

From BibNetWiki

Lecture Notes in Computer Science, Volume 1046

Articles in category "LNCS 1046"

There are 56 articles in this category.

' ''Optimal'' Collecting Semantics for Analysis in a Hierarchy of Logic Program Semantics A A Characterization of the Quadrilateral Meshes of a Surface which Admit a Compatible Hexahedral Mesh of Enclosed Volume A Combinatorial Design Approach to MAXCUT A Decision Procedure for Well-Formed Linear Quantum Cellular Automata A Unified and Generalized Treatment of Authentication Theory An Aperiodic Set of Wang Cubes C Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width Compositional Specification of Timed Systems Compressibility and Resource Bounded Measure Cyclic Languages and Strongly Cyclic Languages E Embedding Graphs with Bounded Tree width into Optimal Hypercubes Extracting Best Consensus Motifs from Positive and Negative Examples F Fault-Tolerant Shared Memory Simulations Fine Separation of Average Time Complexity Classes Flip-Flop Nets G General Inductive Inference Types Based on Linearly-Ordered Sets H Hypothesis Testing in Perfect Phylogeny for a Bounded Number of Characters L Languages Recognized by Finite Aperiodic Groupoids

L cont. Learning with Confidence Linear Programming - Randomization and Abstract Frameworks Lower Bounds for Compact Routing Lyndon Factorization of Infinite Words M Minimal Forbidden Words and Symbolic Dynamics Monadic Second Order Logic on Tree-Like Structures N New Trends in Quantum Computing O Observations on Measures and Lowness for cap deltaP2 On Bijections vs. Unary Functions On Competitive On-Line Paging with Lookahead On Word-Level Parallelism in Fault-Tolerant Computing On the Complexity of Random Strings On the Complexity of Worst Case and Expected Time in a Circuit On the Existence of Hard Sparse Sets under Weak Reductions On the Expressivity of the Modal Mu-Calculus On the Power of Non-observable Actions in Timed Automata On the Successor Function in Non-classical Numeration Systems Optimal Bounds on the Approximation of Boolean Functions with Consequences on the Concept of Hardness Optimal Schedules for d-D Grid Graphs with Communication Delays

O cont. Optimal Tree-Based One-time Digital Signature Schemes P PAC Learning with Simple Examples Parallel Comparability Graph Recognition and Modular Decomposition Proceedings STACS'96 R Ranking and Unranking Trees Using Regular Reductions Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams Remarks on Generalized Post Correspondence Problem Resource-Bounded Balanced Genericity, Stochasticity and Weak Randomness S STACS 96: 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996: proceedings Solvable Black-Box Group Problems Are Low for PP Some Bounds on Multiparty Communication Complexity of Pointer Jumping Star-Height of an IN-Rational Series T The ''log Rank'' Conjecture for Modular Communication Complexity The 3 Frenchmen Method Proves Undecidability of the Uniform Boundedness for Single Recursive Rule Ternary DATALOG Programs The Action of a Few Random Permutations on r-Tuples and an Application to Cryptography The Complexity of Generating and Checking Proofs of Membership Trace Rewriting: Computing Normal Forms in Time O (n log n) U Universal Hashing and k-wise Independent Random Variables via Integer Arithmetic without Primes Upper Bounds on Multiparty Communication Complexity of Shifts