LEADER 07247nam 22007335 450 001 996466031603316 005 20200630032526.0 010 $a3-540-48332-2 024 7 $a10.1007/3-540-57785-8 035 $a(CKB)1000000000234085 035 $a(SSID)ssj0000326868 035 $a(PQKBManifestationID)11225670 035 $a(PQKBTitleCode)TC0000326868 035 $a(PQKBWorkID)10297448 035 $a(PQKB)10861582 035 $a(DE-He213)978-3-540-48332-8 035 $a(PPN)155221736 035 $a(EXLCZ)991000000000234085 100 $a20121227d1994 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aSTACS 94$b[electronic resource] $e11th Annual Symposium on Theoretical Aspects of Computer Science Caen, France, February 24?26, 1994 Proceedings /$fedited by Patrice Enjalbert, Ernst W. Mayr, Klaus W. Wagner 205 $a1st ed. 1994. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1994. 215 $a1 online resource (XIV, 786 p. 9 illus.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v775 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-57785-8 327 $aThe nature and meaning of perturbations in geometric computing -- One binary horn clause is enough -- Transforming constraint logic programs -- A hierarchy of temporal logics with past -- The complexity of resource-bounded first-order classical logic -- Two proof procedures for a cardinality based language in propositional calculus -- The alternation hierarchy for machines with sublogarithmic space is infinite -- Quasilinear time complexity theory -- Space-efficient deterministic simulation of probabilistic automata -- Reachability and the power of local ordering -- Are parallel machines always faster than sequential machines? -- Ground reducibility and automata with disequality constraints -- Perpetuality and strong normalization in orthogonal term rewriting systems -- About changing the ordering during Knuth-Bendix completion -- Combination of matching algorithms -- Periodic constant depth sorting networks -- Optimal pattern matching on meshes -- Faster sorting and routing on grids with diagonals -- Deterministic 1 -k routing on meshes with applications to worm-hole routing -- A unifying type-theoretic framework for objects -- Operational specifications with built-ins -- Reactive variables for system specification and design -- A new parallel vector model, with exact characterization of NCk -- On adaptive dlogtime and polylogtime reductions -- NCk(NP)=AC k?1(NP) -- Hypertransition systems -- On the star operation and the finite power property in free partially commutative monoids -- Coding with traces -- Monadic second-order logic over pictures and recognizability by tiling systems -- Q-grammars: Results, implementation -- A topology for complete semirings -- The global power of additional queries to random oracles -- Cook versus Karp-Levin: Separating completeness notions if NP is not small -- On sets bounded truth-table reducible to P-selective sets -- Two refinements of the polynomial hierarchy -- On different reducibility notions for function classes -- Optimal parallelization of Las Vegas algorithms -- Efficient parallel algorithms for geometric k-clustering problems -- A simple optimal parallel algorithm for reporting paths in a tree -- Parallel detection of all palindromes in a string -- On the structure of parameterized problems in NP -- On the approximability of finding maximum feasible subsystems of linear systems -- On the acceptance power of regular languages -- Complexity classes with finite acceptance types -- The complete axiomatization of Cs-congruence -- Transition system specifications in stalk format with bisimulation as a congruence -- Decidability questions for bisimilarity of Petri nets and some related problems -- The variable membership problem: Succinctness versus complexity -- Economy of description for single-valued transducers -- Automaticity: Properties of a measure of descriptional complexity -- Towards a theory of recursive structures -- Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data -- Nondeterminism in patterns -- Upper bounds for the expected length of a longest common subsequence of two binary sequences -- The ambiguity of primitive words -- On codes having no finite completion -- A new approach to information theory -- On Voronoi diagrams in the L p -metric in higher dimensions -- Total protection of analytic invariant information in cross tabulated tables -- Dominating cliques in graphs with hypertree structure -- On vertex ranking for permutation and other graphs -- Finding all minimal separators of a graph -- On the complexity of the maximum cut problem. 330 $aThis volume constitutes the proceedings of the 11th annual Symposium on Theoretical Aspects of Computer Science (STACS '94), held in Caen, France, February 24-26, 1994. Besides three prominent invited papers, the proceedings contains 60 accepted contributions chosen by the international program committee during a highly competitive reviewing process from a total of 234 submissions for 38 countries. The volume competently represents most areas of theoretical computer science with a certain emphasis on (parallel) algorithms and complexity. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v775 606 $aComputers 606 $aAlgorithms 606 $aComputer logic 606 $aMathematical logic 606 $aComputer programming 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 615 0$aComputers. 615 0$aAlgorithms. 615 0$aComputer logic. 615 0$aMathematical logic. 615 0$aComputer programming. 615 14$aTheory of Computation. 615 24$aComputation by Abstract Devices. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 615 24$aProgramming Techniques. 676 $a004.0151 702 $aEnjalbert$b Patrice$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMayr$b Ernst W$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aWagner$b Klaus W$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996466031603316 996 $aSTACS 94$92830793 997 $aUNISA LEADER 03302nam 2200661 a 450 001 9910786977003321 005 20230725035526.0 010 $a90-8890-181-3 035 $a(CKB)2670000000360771 035 $a(EBL)1187374 035 $a(SSID)ssj0000873893 035 $a(PQKBManifestationID)12382722 035 $a(PQKBTitleCode)TC0000873893 035 $a(PQKBWorkID)10877775 035 $a(PQKB)10048720 035 $a(MiAaPQ)EBC1187374 035 $a(Au-PeEL)EBL1187374 035 $a(CaPaEBR)ebr10702624 035 $a(CaONFJC)MIL487176 035 $a(OCoLC)845255921 035 $a(EXLCZ)992670000000360771 100 $a20110402d2010 uy 0 101 0 $aeng 135 $aurcn||||||||| 181 $ctxt 182 $cc 183 $acr 200 00$aSharing knowledge & cultural heritage$b[electronic resource] $efirst nations of the Americas : studies in collaboration with Indigenous peoples from Greenland, North and South America : proceedings of an expert meeting National Museum of Ethnology Leiden, The Netherlands /$feditors, Laura Van Broekhoven, Cunera Buijs, Pieter Hovens 210 $aLeiden $cSidestone Press$dc2010 215 $a1 online resource (253 p.) 225 1 $aMededelingen van het Rijksmuseum voor Volkenkunde, Leiden ;$vno. 39 300 $aDescription based upon print version of record. 311 $a90-8890-066-3 320 $aIncludes bibliographical references. 330 $aSharing Knowledge & Cultural Heritage (SK&CH), First Nations of the Americas, testifies to the growing commitment of museum professionals in the twenty-first century to share collections with the descendants of people and communities from whom the collections originated. Thanks to collection histories and the documenting of relations with particular indigenous communities, it is well known that until as recently as the 1970's, museum doors - except for a handful of cases - were shut to indigenous peoples. This volume is the result of an ""expert meeting"" held in November 2007 at the National M 410 0$aMededelingen van het Rijksmuseum voor Volkenkunde, Leiden ;$vno. 39. 606 $aEthnological museums and collections$vCongresses 606 $aIntercultural communication$vCongresses 606 $aIndians of North America$xAntiquities$xCollectors and collecting$vCongresses 606 $aIndians of South America$xAntiquities$xCollectors and collecting$vCongresses 606 $aIndigenous peoples$xAntiquities$xCollectors and collecting$zGreenland$vCongresses 615 0$aEthnological museums and collections 615 0$aIntercultural communication 615 0$aIndians of North America$xAntiquities$xCollectors and collecting 615 0$aIndians of South America$xAntiquities$xCollectors and collecting 615 0$aIndigenous peoples$xAntiquities$xCollectors and collecting 676 $a305.80074 701 $aBuijs$b Cunera$01554631 701 $aHovens$b Pieter$01554632 701 $aBroekhoven$b Laura N. K. van$f1972-$01554633 712 02$aRijksmuseum voor Volkenkunde (Netherlands) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910786977003321 996 $aSharing knowledge & cultural heritage$93815961 997 $aUNINA