skip to content
STACS 95 : 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995 : proceedings Preview this item
ClosePreview this item
Checking...

STACS 95 : 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995 : proceedings

Author: Ernst Mayr; Claude Puech
Publisher: Berlin ; New York : Springer, ©1995.
Series: Lecture notes in computer science, 900.
Edition/Format:   eBook : Document : Conference publication : EnglishView all editions and formats
Summary:
This book presents the proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS 95), held in Munich, Germany in March 1995. Besides three invited talks, the book contains revised versions of 53 research papers selected from a total of 180 submissions. The contributions address all current aspects of theoretical computer science; they are organized in sections on complexity theory,  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Electronic books
Conference papers and proceedings
Congressen (vorm)
Congresses
Additional Physical Format: Print version:
Symposium on Theoretical Aspects of Computer Science (12th : 1995 : Munich, Germany).
STACS 95.
Berlin ; New York : Springer, ©1995
(OCoLC)31970534
Material Type: Conference publication, Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Ernst Mayr; Claude Puech
ISBN: 0387590420 9780387590424 3540590420 9783540590422 9783540491750 3540491759
OCLC Number: 326712551
Language Note: English.
Description: 1 online resource (xiii, 654 pages) : illustrations.
Contents: On the synthesis of strategies in infinite games --
Finding the maximum with linear error probabilities: a sequential analysis approach --
Completeness and weak completeness under polynomial-size circuits --
Communication complexity of key agreement on small ranges --
Pseudorandom generators and the frequency of simplicity --
Classes of bounded counting type and their inclusion relations --
Lower bounds for depth-three circuits with equals and mod-gates --
On realizing iterated multiplication by small depth threshold circuits --
A random NP-complete problem for inversion of 2D cellular automata --
On the subword equivalence problem for infinite words --
On the separators on an infinite word generated by a morphism --
Systolic tree?-languages --
Structural complexity of?-automata --
Algorithms explained by symmetries --
Generalized scans and tri-diagonal systems --
Two-dimensional pattern matching in linear time and small space --
On-line and dynamic algorithms for shortest path problems --
On compact representations of propositional circumscription --
A set-theoretic translation method for (poly)modal logics --
On the synthesis of discrete controllers for timed systems --
A fully abstract semantics for causality in the?-calculus --
On the sizes of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks --
Exploiting storage redundancy to speed up randomized shared memory simulations --
Interval routing schemes --
A packet routing protocol for arbitrary networks --
A family of tag systems for paperfolding sequences --
Growing context-sensitive languages and Church-Rosser languages --
Deterministic generalized automata --
Optimal simulation of automata by neural nets --
Concurrent process equivalences: Some decision problems --
Optimal lower bounds on the multiparty communication complexity --
Simultaneous messages vs. communication --
Coding and strong coding in trace monoids --
On codings of traces --
Finding largest common embeddable subtrees --
The?t-coloring problem --
Expander properties in random regular graphs with edge faults --
Dynamic analysis of the sizes of relations --
On slender context-free languages --
Partial derivatives of regular expressions and finite automata constructions --
Dependence orders for computations of concurrent automata --
On the undecidability of deadlock detection in families of nets --
On the average running time of odd-even merge sort --
Optimal average case sorting on arrays --
Normal numbers and sources for BPP --
Lower bounds on learning decision lists and trees --
Line segmentation of digital curves in parallel --
Computability of convex sets --
Enumerating extreme points in higher dimensions --
The number of views of piecewise-smooth algebraic objects --
On the structure of log-space probabilistic complexity classes --
Resource-bounded instance complexity --
On the sparse set conjecture for sets with low density --
Beyond PNP=NEXP --
Malign distributions for average case circuit complexity --
A possible code in the genetic code.
Series Title: Lecture notes in computer science, 900.
Responsibility: Ernst W. Mayr, Claude Puech, eds.

Abstract:

they are organized in sections on complexity theory, automata theory, algorithms, logic, theory of parallel computing, communication theory, graph theory and databases, and computational geometry.  Read more...

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/326712551> # STACS 95 : 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995 : proceedings
    a schema:MediaObject, schema:Book, schema:CreativeWork ;
   library:oclcnum "326712551" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/352234248#Place/berlin> ; # Berlin
   library:placeOfPublication <http://dbpedia.org/resource/New_York_City> ; # New York
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
   schema:about <http://id.worldcat.org/fast/872451> ; # Computer science
   schema:about <http://experiment.worldcat.org/entity/work/data/352234248#Topic/engineering_&_applied_sciences> ; # Engineering & Applied Sciences
   schema:about <http://experiment.worldcat.org/entity/work/data/352234248#Topic/fundamentele_informatica> ; # Fundamentele informatica
   schema:about <http://experiment.worldcat.org/entity/work/data/352234248#Topic/computer_science> ; # Computer science
   schema:about <http://dewey.info/class/004.01511/e20/> ;
   schema:bookFormat schema:EBook ;
   schema:contributor <http://viaf.org/viaf/24778931> ; # Claude Puech
   schema:contributor <http://viaf.org/viaf/79106130> ; # Ernst Mayr
   schema:copyrightYear "1995" ;
   schema:creator <http://experiment.worldcat.org/entity/work/data/352234248#Meeting/annual_symposium_on_theoretical_aspects_of_computer_science_12th_1995_munich_germany> ; # Annual Symposium on Theoretical Aspects of Computer Science (12th : 1995 : Munich, Germany)
   schema:datePublished "1995" ;
   schema:description "This book presents the proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS 95), held in Munich, Germany in March 1995. Besides three invited talks, the book contains revised versions of 53 research papers selected from a total of 180 submissions. The contributions address all current aspects of theoretical computer science; they are organized in sections on complexity theory, automata theory, algorithms, logic, theory of parallel computing, communication theory, graph theory and databases, and computational geometry."@en ;
   schema:description "On the synthesis of strategies in infinite games -- Finding the maximum with linear error probabilities: a sequential analysis approach -- Completeness and weak completeness under polynomial-size circuits -- Communication complexity of key agreement on small ranges -- Pseudorandom generators and the frequency of simplicity -- Classes of bounded counting type and their inclusion relations -- Lower bounds for depth-three circuits with equals and mod-gates -- On realizing iterated multiplication by small depth threshold circuits -- A random NP-complete problem for inversion of 2D cellular automata -- On the subword equivalence problem for infinite words -- On the separators on an infinite word generated by a morphism -- Systolic tree?-languages -- Structural complexity of?-automata -- Algorithms explained by symmetries -- Generalized scans and tri-diagonal systems -- Two-dimensional pattern matching in linear time and small space -- On-line and dynamic algorithms for shortest path problems -- On compact representations of propositional circumscription -- A set-theoretic translation method for (poly)modal logics -- On the synthesis of discrete controllers for timed systems -- A fully abstract semantics for causality in the?-calculus -- On the sizes of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks -- Exploiting storage redundancy to speed up randomized shared memory simulations -- Interval routing schemes -- A packet routing protocol for arbitrary networks -- A family of tag systems for paperfolding sequences -- Growing context-sensitive languages and Church-Rosser languages -- Deterministic generalized automata -- Optimal simulation of automata by neural nets -- Concurrent process equivalences: Some decision problems -- Optimal lower bounds on the multiparty communication complexity -- Simultaneous messages vs. communication -- Coding and strong coding in trace monoids -- On codings of traces -- Finding largest common embeddable subtrees -- The?t-coloring problem -- Expander properties in random regular graphs with edge faults -- Dynamic analysis of the sizes of relations -- On slender context-free languages -- Partial derivatives of regular expressions and finite automata constructions -- Dependence orders for computations of concurrent automata -- On the undecidability of deadlock detection in families of nets -- On the average running time of odd-even merge sort -- Optimal average case sorting on arrays -- Normal numbers and sources for BPP -- Lower bounds on learning decision lists and trees -- Line segmentation of digital curves in parallel -- Computability of convex sets -- Enumerating extreme points in higher dimensions -- The number of views of piecewise-smooth algebraic objects -- On the structure of log-space probabilistic complexity classes -- Resource-bounded instance complexity -- On the sparse set conjecture for sets with low density -- Beyond PNP=NEXP -- Malign distributions for average case circuit complexity -- A possible code in the genetic code."@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/352234248> ;
   schema:genre "Electronic books"@en ;
   schema:genre "Conference papers and proceedings"@en ;
   schema:genre "Congressen (vorm)"@en ;
   schema:genre "Conference publication"@en ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/352234248#Series/lecture_notes_in_computer_science> ; # Lecture notes in computer science ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/31970534> ;
   schema:name "STACS 95 : 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995 : proceedings"@en ;
   schema:productID "326712551" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/326712551#PublicationEvent/berlin_new_york_springer_1995> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/352234248#Agent/springer> ; # Springer
   schema:url <http://link.springer.com/openurl?genre=book&isbn=978-3-540-59042-2> ;
   schema:url <http://dx.doi.org/10.1007/3-540-59042-0> ;
   schema:url <http://link.springer.com/10.1007/3-540-59042-0> ;
   schema:workExample <http://worldcat.org/isbn/9780387590424> ;
   schema:workExample <http://dx.doi.org/10.1007/3-540-59042-0> ;
   schema:workExample <http://worldcat.org/isbn/9783540590422> ;
   schema:workExample <http://worldcat.org/isbn/9783540491750> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/326712551> ;
    .


Related Entities

<http://dbpedia.org/resource/New_York_City> # New York
    a schema:Place ;
   schema:name "New York" ;
    .

<http://experiment.worldcat.org/entity/work/data/352234248#Meeting/annual_symposium_on_theoretical_aspects_of_computer_science_12th_1995_munich_germany> # Annual Symposium on Theoretical Aspects of Computer Science (12th : 1995 : Munich, Germany)
    a bgn:Meeting, schema:Event ;
   schema:location <http://experiment.worldcat.org/entity/work/data/352234248#Place/munich_germany> ; # Munich, Germany)
   schema:name "Annual Symposium on Theoretical Aspects of Computer Science (12th : 1995 : Munich, Germany)" ;
    .

<http://experiment.worldcat.org/entity/work/data/352234248#Place/munich_germany> # Munich, Germany)
    a schema:Place ;
   schema:name "Munich, Germany)" ;
    .

<http://experiment.worldcat.org/entity/work/data/352234248#Series/lecture_notes_in_computer_science> # Lecture notes in computer science ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/326712551> ; # STACS 95 : 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995 : proceedings
   schema:name "Lecture notes in computer science ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/352234248#Topic/engineering_&_applied_sciences> # Engineering & Applied Sciences
    a schema:Intangible ;
   schema:name "Engineering & Applied Sciences"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/352234248#Topic/fundamentele_informatica> # Fundamentele informatica
    a schema:Intangible ;
   schema:name "Fundamentele informatica"@en ;
    .

<http://id.worldcat.org/fast/872451> # Computer science
    a schema:Intangible ;
   schema:name "Computer science"@en ;
    .

<http://viaf.org/viaf/24778931> # Claude Puech
    a schema:Person ;
   schema:familyName "Puech" ;
   schema:givenName "Claude" ;
   schema:name "Claude Puech" ;
    .

<http://viaf.org/viaf/79106130> # Ernst Mayr
    a schema:Person ;
   schema:familyName "Mayr" ;
   schema:givenName "Ernst" ;
   schema:name "Ernst Mayr" ;
    .

<http://worldcat.org/isbn/9780387590424>
    a schema:ProductModel ;
   schema:isbn "0387590420" ;
   schema:isbn "9780387590424" ;
    .

<http://worldcat.org/isbn/9783540491750>
    a schema:ProductModel ;
   schema:isbn "3540491759" ;
   schema:isbn "9783540491750" ;
    .

<http://worldcat.org/isbn/9783540590422>
    a schema:ProductModel ;
   schema:isbn "3540590420" ;
   schema:isbn "9783540590422" ;
    .

<http://www.worldcat.org/oclc/31970534>
    a schema:CreativeWork ;
   rdfs:label "STACS 95." ;
   schema:description "Print version:" ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/326712551> ; # STACS 95 : 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995 : proceedings
    .

<http://www.worldcat.org/title/-/oclc/326712551>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
   schema:about <http://www.worldcat.org/oclc/326712551> ; # STACS 95 : 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995 : proceedings
   schema:dateModified "2017-10-22" ;
   void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.