Del i serien Lecture Notes in Computer Science

STACS 96

13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996. Proceedings

Häftad, Engelska, 1996

1 479 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the refereed proceedings of the 13th Symposium on Theoretical Aspects of Computer Science, STACS 96, held in Grenoble, France in February 1996.The 52 revised papers presented were selected from a total of 185 submissions; also included are three invited papers. The volume addresses all current aspects of theoretical computer science and is organized in sections on complexity theory, automata theory, parallel algorithms, learning, parallel and distributed systems, cryptography, logic and database theory, algorithms, semantics and program verification, and communication complexity.

Produktinformation

Utgivningsdatum1996-02-14
Mått155 x 235 x 38 mm
Vikt1 054 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor690
Upplaga1996
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540609223

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT

New trends in quantum computing.- Compressibility and resource bounded measure.- On the complexity of random strings.- Remarks on generalized Post Correspondence Problem.- Cyclic languages and strongly cyclic languages.- Resource-bounded balanced genericity, stochasticity and weak randomness.- The complexity of generating and checking proofs of membership.- Observations on measure and lowness for ? 2 P .- Solvable black-box group problems are low for PP.- Languages recognized by finite aperiodic groupoids.- Star-height of an N-rational series.- An aperiodic set of Wang cubes.- Lyndon factorization of infinite words.- Embedding graphs with bounded treewidth into optimal hypercubes.- Parallel comparability graph recognition and modular decomposition.- Fault-tolerant shared memory simulations.- On word-level parallelism in fault-tolerant computing.- Learning with confidence.- Extracting best consensus motifs from positive and negative examples.- PAC learning with simple examples.- General inductive inference types based on linearly-ordered sets.- On the power of non-observable actions in timed automata.- Trace rewriting: Computing normal forms in time O(n log n).- A decision procedure for well-formed linear quantum cellular automata.- On the complexity of worst case and expected time in a circuit.- On the existence of hard sparse sets under weak reductions.- Optimal bounds on the approximation of boolean functions with consequences on the concept of hardness.- Fine separation of average time complexity classes.- Compositional specification of timed systems.- Optimal tree-based one-time digital signature schemes.- The action of a few random permutations on r-tuples and an application to cryptography.- A unified and generalized treatment of authentication theory.- Monadicsecond order logic on tree-like structures.- On bijections vs. unary functions.- The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG Programs.- A combinatorial design approach to MAXCUT.- Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width.- A characterization of the quadrilateral meshes of a surface which admit a compatible hexahedral mesh of the enclosed volume.- On the expressivity of the modal mu-calculus.- Read-once projections and formal circuit verification with binary decision diagrams.- “Optimal” collecting semantics for analysis in a hierarchy of logic program semantics.- Flip-flop nets.- Lower bounds for compact routing.- On the successor function in non-classical numeration systems.- Minimal forbidden words and symbolic dynamics.- Universal hashing and k-wise independent random variables via integer arithmetic without primes.- Ranking and unranking trees using regular reductions.- On competitive on-line paging with lookahead.- Hypothesis testing in perfect phylogeny for a bounded number of characters.- The “log rank” conjecture for modular communication complexity.- Upper bounds on multiparty communication complexity of shifts.- Some bounds on multiparty communication complexity of pointer jumping.- Optimal schedules for d-D grid graphs with communication delays.- Linear programming — Randomization and abstract frameworks.

Du kanske också är intresserad av

Contemporary Grandparenting

Arthur Kornhaber

Häftad, 1996

2 279 kr

STACS 95

Ernst W. Mayr, Claude Puech

Häftad, 1995

1 479 kr

STACS 97

Rüdiger Reischuk, Michel Morvan

Häftad, 1997

1 479 kr

Moral Leadership

Thomas J. Sergiovanni

Häftad, 1996

309 kr

Blues Detective

Stephen Soitos

Häftad, 1996

849 kr

Saint Dominic and the Rosary

Catherine Beebe

Häftad, 1996

249 kr

Elektronische Schaltungen 1

Horst Wupper, Ulf Niemeyer

Inbunden, 1996

739 kr

Remembering Elizabeth Bishop

Gary Fountain, Peter Brazeau

Häftad, 1996

859 kr

Choosing Correctional Options That Work

Alan T. Harland, Alan Harland

Häftad, 1996

2 279 kr

Art of Problem Solving

Alfred S. Posamentier, Wolfgang Shulz, Alfred S. Posamentier, Wolfgang Schulz

Häftad, 1996

919 kr

Del i serien Lecture Notes in Computer Science

STACS 96

13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996. Proceedings

Häftad, Engelska, 1996

AvClaude Puech,Rüdiger Reischuk

1 479 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum1996-02-14
Mått155 x 235 x 38 mm
Vikt1 054 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor690
Upplaga1996
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540609223

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT

New trends in quantum computing.- Compressibility and resource bounded measure.- On the complexity of random strings.- Remarks on generalized Post Correspondence Problem.- Cyclic languages and strongly cyclic languages.- Resource-bounded balanced genericity, stochasticity and weak randomness.- The complexity of generating and checking proofs of membership.- Observations on measure and lowness for ? 2 P .- Solvable black-box group problems are low for PP.- Languages recognized by finite aperiodic groupoids.- Star-height of an N-rational series.- An aperiodic set of Wang cubes.- Lyndon factorization of infinite words.- Embedding graphs with bounded treewidth into optimal hypercubes.- Parallel comparability graph recognition and modular decomposition.- Fault-tolerant shared memory simulations.- On word-level parallelism in fault-tolerant computing.- Learning with confidence.- Extracting best consensus motifs from positive and negative examples.- PAC learning with simple examples.- General inductive inference types based on linearly-ordered sets.- On the power of non-observable actions in timed automata.- Trace rewriting: Computing normal forms in time O(n log n).- A decision procedure for well-formed linear quantum cellular automata.- On the complexity of worst case and expected time in a circuit.- On the existence of hard sparse sets under weak reductions.- Optimal bounds on the approximation of boolean functions with consequences on the concept of hardness.- Fine separation of average time complexity classes.- Compositional specification of timed systems.- Optimal tree-based one-time digital signature schemes.- The action of a few random permutations on r-tuples and an application to cryptography.- A unified and generalized treatment of authentication theory.- Monadicsecond order logic on tree-like structures.- On bijections vs. unary functions.- The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG Programs.- A combinatorial design approach to MAXCUT.- Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width.- A characterization of the quadrilateral meshes of a surface which admit a compatible hexahedral mesh of the enclosed volume.- On the expressivity of the modal mu-calculus.- Read-once projections and formal circuit verification with binary decision diagrams.- “Optimal” collecting semantics for analysis in a hierarchy of logic program semantics.- Flip-flop nets.- Lower bounds for compact routing.- On the successor function in non-classical numeration systems.- Minimal forbidden words and symbolic dynamics.- Universal hashing and k-wise independent random variables via integer arithmetic without primes.- Ranking and unranking trees using regular reductions.- On competitive on-line paging with lookahead.- Hypothesis testing in perfect phylogeny for a bounded number of characters.- The “log rank” conjecture for modular communication complexity.- Upper bounds on multiparty communication complexity of shifts.- Some bounds on multiparty communication complexity of pointer jumping.- Optimal schedules for d-D grid graphs with communication delays.- Linear programming — Randomization and abstract frameworks.