000			14770cam a2201081 a 4500
001			ocn806059092
003			OCoLC
005			20250703161757.0
006			m o d
007			cr cnu---unuuu
008			120814s2012 gw a ob 101 0 eng d
040			_aGW5XE _beng _epn _cGW5XE _dC$Q _dZMC _dCOO _dUKMGB _dZMC _dOCLCQ _dE7B _dOCLCF _dBEDGE _dOCLCO _dYDXCP _dOCL _dOCLCO _dOCLCQ _dEBLCP _dOCLCQ _dVGM _dESU _dOCLCQ _dIOG _dNJR _dBUF _dREB _dVMW _dCOS _dCOF _dCEF _dU3W _dWYU _dUWO _dYOU _dTKN _dLEAUB _dW2U _dOCLCQ _dAJS _dOCLCQ _dOCLCO _dUKAHL _dOCLCO _dOCLCQ _dDCT _dDKDLA _dOCLCO _dOCLCQ
066			_c(S
016	7		_a016169308 _2Uk
019			_a1154946315 _a1204014934
020			_a9783642325892 _q(electronic bk.)
020			_a3642325890 _q(electronic bk.)
020			_z9783642325885
020			_z3642325882 _q(Trade Paper)
020			_a3642325882
020			_a9783642325885
024	7		_a10.1007/978-3-642-32589-2 _2doi
024	3		_a9783642325885
029	1		_aAU@ _b000050021889
029	1		_aAU@ _b000058160302
029	1		_aNLGGC _b384331033
029	1		_aNZ1 _b14675919
029	1		_aAU@ _b000060505354
029	1		_aDKDLA _b820120-katalog:999910454905765
035			_a(OCoLC)806059092 _z(OCoLC)1154946315 _z(OCoLC)1204014934
037			_a9783642325885 _b00024965
050		4	_aQA76.9.M35 _bS96 2012
082	0	4	_a004.01/51 _223
049			_aMAIN
111	2		_aSymposium on Mathematical Foundations of Computer Science (1972- ) _n(37th : _d2012 : _cBratislava, Slovakia) _946152
245	1	0	_aMathematical foundations of computer science 2012 : _b37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings / _cBranislav Rovan, Vladimiro Sassone, Peter Widmayer (eds.).
246	3	0	_aMFCS 2012
260			_aBerlin ; _aNew York : _bSpringer, _c©2012.
300			_a1 online resource (xv, 838 pages) : _billustrations
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aLecture notes in computer science, _x1611-3349 ; _v7464. _aAdvanced research in computing and software science
490	1		_aLNCS sublibrary. SL 1, Theoretical computer science and general issues
505	0	0	_tOn the Complexity of Ontological Reasoning under Disjunctive Existential Rules / _rGeorg Gottlob, Marco Manna, Michael Morak and Andreas Pieris -- _tNew Races in Parameterized Algorithmics / _rChristian Komusiewicz and Rolf Niedermeier -- _tScott Is Always Simple / _rAntonino Salibra -- _tA Toolkit for Proving Limitations of the Expressive Power of Logics / _rNicole Schweikardt -- _tHow to Reconstruct a Genome / _rEsko Ukkonen -- _tSimple Models for Recursive Schemes / _rIgor Walukiewicz -- _tTransportation under Nasty Side Constraints / _rGerhard J. Woeginger -- _tComputation of Least Fixed Points / _rMihalis Yannakakis -- _tUnordered Constraint Satisfaction Games / _rLauri Ahlroth and Pekka Orponen -- _tA Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree / _rTatsuya Akutsu and Takeyuki Tamura -- _tReductions to the Set of Random Strings: The Resource-Bounded Case / _rEric Allender, Harry Buhrman, Luke Friedman and Bruno Loff -- _tApproximate Graph Isomorphism / _rVikraman Arvind, Johannes Köbler, Sebastian Kuhnert and Yadu Vasudev -- _tNear-Optimal Expanding Generator Sets for Solvable Permutation Groups / _rVikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar and Yadu Vasudev -- _tGenerating Functions of Timed Languages / _rEugene Asarin, Nicolas Basset, Aldric Degorre and Dominique Perrin -- _tThe Robust Set Problem: Parameterized Complexity and Approximation / _rCristina Bazgan and Morgan Chopin -- _tMortality for 2 x 2 Matrices Is NP-Hard / _rPaul C. Bell, Mika Hirvensalo and Igor Potapov -- _tSolving Counter Parity Games / _rDietmar Berwanger, Łukasz Kaiser and Simon Lessenich -- _tDrawing Planar Graphs on Points Inside a Polygon / _rTherese Biedl and Peter Floderus -- _tNew Advances in Reoptimizing the Minimum Steiner Tree Problem / _rDavide Bilò and Anna Zych -- _tSmoothed Complexity Theory / _rMarkus Bläser and Bodo Manthey -- _tAbelian Pattern Avoidance in Partial Words / _rFrancine Blanchet-Sadri and Sean Simmons -- _tThe Complexity of Rerouting Shortest Paths / _rPaul Bonsma -- _tComputing with Large Populations Using Interactions / _rOlivier Bournez, Pierre Fraigniaud and Xavier Koegler -- _tPancake Flipping Is Hard / _rLaurent Bulteau, Guillaume Fertin and Irena Rusu -- _tIn-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses / _rJingsen Chen, Stefan Edelkamp, Amr Elmasry and Jyrki Katajainen -- _tModel Checking Stochastic Branching Processes / _rTaolue Chen, Klaus Dräger and Stefan Kiefer.
505	8	0	_tParameterized Study of the Test Cover Problem / _rRobert Crowston, Gregory Gutin, Mark Jones, Saket Saurabh and Anders Yeo -- _tSitting Closer to Friends Than Enemies, Revisited / _rMarek Cygan, Marcin Pilipczuk, Michał Pilipczuk and Jakub Onufry Wojtaszczyk -- _tA Dichotomy Theorem for Homomorphism Polynomials / _rNicolas de Rugy-Altherre -- _tFinite State Transducers for Modular Möbius Number Systems / _rMartin Delacourt and Petr Kůrka -- _tZero-Knowledge Proofs via Polynomial Representations / _rGiovanni Di Crescenzo and Vadym Fedyukovych -- _tCluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width / _rMartin Doucha and Jan Kratochvíl -- _tOn the Impact of Fair Best Response Dynamics / _rAngelo Fanelli, Luca Moscardelli and Alexander Skopalik -- _tFast Balanced Partitioning Is Hard Even on Grids and Trees / _rAndreas Emil Feldmann -- _tA Characterization of Bispecial Sturmian Words / _rGabriele Fici -- _tOnline Sum-Radii Clustering / _rDimitris Fotakis and Paraschos Koutris -- _tObserve and Remain Silent (Communication-Less Agent Location Discovery) / _rTom Friedetzky, Leszek Gąsieniec, Thomas Gorry and Russell Martin -- _tWhen Trees Grow Low: Shrubs and Fast MSO1 / _rRobert Ganian, Petr Hliněný, Jaroslav Nešetřil, Jan Obdržálek and Patrice Ossona de Mendez, et al. -- _tStrategy Machines and Their Complexity / _rMarcus Gelderie -- _tColoring Graphs Characterized by a Forbidden Subgraph / _rPetr A. Golovach, Daniël Paulusma and Bernard Ries -- _tObtaining Planarity by Contracting Few Edges / _rPetr A. Golovach, Pim van 't Hof and Daniël Paulusma -- _tLight Spanners in Bounded Pathwidth Graphs / _rMichelangelo Grigni and Hao-Hsiang Hung -- _tPlanarizing Gadgets for Perfect Matching Do Not Exist / _rRohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub and Thomas Thierauf -- _tKernels for Edge Dominating Set: Simpler or Smaller / _rTorben Hagerup -- _tCategories of Coalgebraic Games / _rFurio Honsell, Marina Lenisa and Rekha Redamalla -- _tQuasi-recognizable vs MSO Definable Languages of One-Dimensional Overlapping Tiles / _g(Extended Abstract) / _rDavid Janin -- _tAn Improved Approximation Scheme for Variable-Sized Bin Packing / _rKlaus Jansen and Stefan Kraft -- _tGathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection / _rSayaka Kamei, Anissa Lamani, Fukuhito Ooshita and Sébastien Tixeuil -- _tReversal Hierarchies for Small 2DFAs / _rChristos A. Kapoutsis and Giovanni Pighizzini.
505	8	0	_tStrictness of the Collapsible Pushdown Hierarchy / _rAlexander Kartzow and Paweł Parys -- _tComputational Complexity of Smooth Differential Equations / _rAkitoshi Kawamura, Hiroyuki Ota, Carsten Rösnick and Martin Ziegler -- _tThe Lower Reaches of Circuit Uniformity / _rChristoph Behle, Andreas Krebs, Klaus-Jörn Lange and Pierre McKenzie -- _tThe Join Levels of the Trotter-Weil Hierarchy Are Decidable / _rManfred Kufleitner and Alexander Lauser -- _tEquations X+A=B and (X+X)+C=(X -- X)+D over Sets of Natural Numbers / _rTommi Lehtinen -- _tWeakly-Synchronized Ground Tree Rewriting (with Applications to Verifying Multithreaded Programs) / _rAnthony Widjaja Lin -- _tDescriptional Complexity of Deterministic Regular Expressions / _rKatja Losemann, Wim Martens and Matthias Niewerth -- _tIdentity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs / _rMeena Mahajan, B.V. Raghavendra Rao and Karteek Sreenivasaiah -- _tFine and Wilf's Theorem and Pseudo-repetitions / _rFlorin Manea, Robert Mercaş and Dirk Nowotka -- _tTaking It to the Limit: Approximate Reasoning for Markov Processes / _rKim Guldstrand Larsen, Radu Mardare and Prakash Panangaden -- _tAsymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games / _rMatúš Mihalák and Jan Christoph Schlegel -- _tBetween Tree Patterns and Conjunctive Queries: Is There Tractability beyond Acyclicity? / _rFilip Murlak, Michał Ogiński and Marcin Przybyłko -- _tReducing a Target Interval to a Few Exact Queries / _rJesper Nederlof, Erik Jan van Leeuwen and Ruben van der Zwaan -- _tMaximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs / _rSotiris Nikoletseas, Christoforos Raptopoulos and Paul G. Spirakis -- _tA Finite Basis for 'Almost Future' Temporal Logic over the Reals / _rDorit Pardo (Ordentlich) and Alexander Rabinovich -- _tConstructing Premaximal Ternary Square-Free Words of Any Level / _rElena A. Petrova and Arseny M. Shur -- _tRegularity Problems for Weak Pushdown [omega]-Automata and Games / _rChristof Löding and Stefan Repke -- _tComputational Aspects of Cellular Automata on Countable Sofic Shifts / _rVille Salo and Ilkka Törmä -- _tComputing Lempel-Ziv Factorization Online / _rTatiana Starikovskaya -- _tOn Two Stronger Versions of Dejean's Conjecture / _rIgor N. Tunev and Arseny M. Shur -- _tProbabilistic Automata and Probabilistic Logic / _rThomas Weidner -- _tA Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments / _rMingyu Xiao and Jiong Guo.
500			_aInternational conference proceedings.
504			_aIncludes bibliographical references and author index.
588	0		_aOnline resource; title from PDF title page (SpringerLink, viewed August 27, 2012).
520			_aThis volume constitutes the refereed proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science, MFCS 2012, held in Bratislava, Slovakia, in August 2012. The 63 revised full papers presented together with 8 invited talks were carefully reviewed and selected from 162 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.
650		0	_aComputer science _xMathematics _vCongresses. _915039
650		0	_aComputer programming _vCongresses.
650		0	_aComputer algorithms _vCongresses. _914835
650		6	_aInformatique _xMathématiques _vCongrès. _920905
650		6	_aProgrammation (Informatique) _vCongrès.
650		6	_aAlgorithmes _vCongrès. _917080
650		6	_aLogiciels. _926065
650		6	_aInformatique. _914930
650		7	_asoftware. _2aat _916724
650		7	_acomputer science. _2aat _9941
650		7	_adata processing. _2aat _914620
650		7	_aInformatique. _2eclas _914930
650		7	_aComputer algorithms _2fast _9896
650		7	_aComputer programming _2fast _93021
650		7	_aComputer science _xMathematics _2fast _92386
653		4	_aComputer science.
653		4	_aData structures (Computer science)
653		4	_aComputational complexity.
653		4	_aAlgorithm Analysis and Problem Complexity.
653		4	_aDiscrete Mathematics in Computer Science.
653		4	_aNumeric Computing.
653		4	_aMathematical Logic and Formal Languages.
653		4	_aMath Applications in Computer Science.
655		7	_aConference papers and proceedings _2fast _96065
655		7	_aSoftware. _2lcgft _998343
700	1		_aRovan, B. _q(Branislav) _941045
700	1		_aSassone, Vladimiro. _926551
700	1		_aWidmayer, Peter. _938741
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783642325885
830		0	_aLecture notes in computer science ; _v7464. _x1611-3349
830		0	_aLecture notes in computer science. _pAdvanced research in computing and software science.
830		0	_aLNCS sublibrary. _nSL 1, _pTheoretical computer science and general issues. _920736
856	4	0	_uhttps://link.springer.com/10.1007/978-3-642-32589-2
880	0		_6505-00/(S _aOn the Complexity of Ontological Reasoning under Disjunctive -- Existential Rules -- New Races in Parameterized Algorithmics -- Scott Is Always Simple -- Simple Models for Recursive Schemes -- Unordered Constraint Satisfaction Games -- A Polynomial-Time Algorithm for Computing the Maximum Common -- Subgraph of Outerplanar Graphs of Bounded Degree -- Reductions to the Set of Random Strings: The Resource-Bounded Case -- Approximate Graph Isomorphism -- Near-Optimal Expanding Generator Sets for Solvable Permutation Groups -- Generating Functions of Timed Languages -- The Robust Set Problem: Parameterized Complexity and Approximation -- Mortality for 2 x 2 Matrices Is NP-Hard -- Solving Counter Parity Games -- Drawing Planar Graphs on Points Inside a Polygon -- Smoothed Complexity Theory -- Abelian Pattern Avoidance in Partial Words -- The Complexity of Rerouting Shortest Paths -- Computing with Large Populations Using Interactions -- Pancake Flipping Is Hard -- In-place Heap Construction with Optimized Comparisons, Moves, and Cache -- A Dichotomy Theorem for Homomorphism -- On the Impact of Fair Best Response Dynamics -- When Trees Grow Low: Shrubs and Fast MSO1 -- Obtaining Planarity by Contracting Few Kernels for Edge Dominating Set -- Quasi-recognizable vs MSO Definable Languages of One-Dimensional -- Reversal Hierarchies for Small -- The Lower Reaches of Circuit Weakly-Synchronized Ground Tree Rewriting -- Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs -- Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games -- Maximum Cliques in Graphs with Small Intersection Number and Random Intersection -- Regularity Problems for Weak Pushdown ω-Automata and Games -- Computational Aspects of Cellular Automata on Countable Sofic Shifts -- On Two Stronger Versions of Dejean's Conjecture -- A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments.
938			_aAskews and Holts Library Services _bASKH _nAH29654854
938			_aProQuest Ebook Central _bEBLB _nEBL3069940
938			_aebrary _bEBRY _nebr10651278
938			_aYBP Library Services _bYANK _n9639166
994			_a92 _bATIST
999			_c641993 _d641993