{"entities":{"Q5943786":{"pageid":8120588,"ns":120,"title":"Item:Q5943786","lastrevid":31508804,"modified":"2024-03-19T18:19:00Z","type":"item","id":"Q5943786","labels":{"en":{"language":"en","value":"Mathematical foundations of computer science 2001. 26th international symposium, MFCS 2001, Mari\u00e1nsk\u00e9 L\u00e1zn\u011b, Czech Republic, August 27--31, 2001. Proceedings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1648465"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5943786$78399D2D-4290-426C-A4AD-A5C376B9B02D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"ce935f5917e158578c530f7471a4416ded2b955a","datavalue":{"value":{"text":"Mathematical foundations of computer science 2001. 26th international symposium, MFCS 2001, Mari\u00e1nsk\u00e9 L\u00e1zn\u011b, Czech Republic, August 27--31, 2001. Proceedings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5943786$38E5D6F1-D056-4083-AADE-5CECC93F0506","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"ce9d238127e617701cea19327dfc734c40963c14","datavalue":{"value":"0969.00078","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5943786$070FD079-C369-4623-B5D9-56BC8E6647EC","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"704719d3ed514a458f7bd978fc7d70389235e6b7","datavalue":{"value":"10.1007/3-540-44683-4","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5943786$08A4B863-C215-4CEF-8F98-062E2A91B4B5","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"85c07c7737819bff773f78e2590a3bb761fe677b","datavalue":{"value":{"entity-type":"item","numeric-id":162374,"id":"Q162374"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5943786$7ACFF0FF-E72A-49AA-B343-893269A021F0","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"175f29debcecd1c84977f0ceae8e3095d272950b","datavalue":{"value":{"time":"+2001-09-19T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5943786$B6B5977F-ED1B-40F9-B3A2-917092420B4D","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"459b50bf8337ab0a67a46591578ef8082843543f","datavalue":{"value":"The articles of this volume will be reviewed individually. The preceding symposium (25th, 2000) has been reviewed (see Zbl 0944.00070).  Indexed articles:  \\textit{Scott, Dana S.}, A new category for semantics, 1-2 [Zbl 1005.68881]  \\textit{B\u00fcrgisser, Peter}, On implications between P-NP-hypotheses: Decision versus computation in algebraic complexity, 3-17 [Zbl 0999.68083]  \\textit{Demaine, Erik D.}, Playing games with algorithms: Algorithmic combinatorial game theory, 18-32 [Zbl 1021.91009]  \\textit{Gottlob, Georg; Leone, Nicola; Scarcello, Francesco}, Hypertree decompositions: A survey, 37-57 [Zbl 1001.05087]  \\textit{Hofmann, Martin}, The strength of non-size-increasing computation (introduction and summary), 58-61 [Zbl 0999.68514]  \\textit{H\u00f8yer, Peter}, Introduction to recent quantum algorithms, 62-73 [Zbl 0999.68511]  \\textit{Randall, Dana}, Decomposition methods and sampling circuits in the Cartesian lattice, 74-86 [Zbl 1004.60076]  \\textit{Sch\u00f6ning, Uwe}, New algorithms for \\(k\\)-SAT based on the local search principle, 87-95 [Zbl 0999.68205]  \\textit{Wilke, Thomas}, Linear temporal logic and finite semigroups, 96-110 [Zbl 1005.03507]  \\textit{Alber, Jochen; Fan, Hongbing; Fellows, Michael R.; Fernau, Henning; Niedermeier, Rolf; Rosamond, Fran; Stege, Ulrike}, Refined search tree technique for DOMINATING SET on planar graphs, 111-122 [Zbl 0999.68158]  \\textit{Amano, Kazuyuki; Hirosawa, Tsukuru; Watanabe, Yusuke; Maruoka, Akira}, The computational power of a family of decision forests, 123-134 [Zbl 0999.68516]  \\textit{Ambainis, Andris; Kikusts, Arnolds}, Exact result for accepting probabilities of quantum automata, 135-147 [Zbl 0999.68102]  \\textit{Atserias, Albert}, Improved bounds on the Weak Pigeonhole Principle and infinitely many primes from weaker axioms, 148-158 [Zbl 0999.03052]  \\textit{Barrett, Chris; Hunt, Harry B. III; Marathe, Madhav V.; Ravi, S. S.; Rosenkrantz, Daniel J.; Stearns, Richard E.}, Analysis problems for sequential dynamical systems and communicating state machines, 159-172 [Zbl 1006.37012]  \\textit{Beaudry, Martin; Holzer, Markus}, The complexity of tensor circuit evaluation (extended abstract), 173-185 [Zbl 0999.68515]  \\textit{Bl\u00e4ser, Markus}, Computing reciprocals of bivariate power series, 186-197 [Zbl 0999.68087]  \\textit{Bouajjani, Ahmed; Habermehl, Peter; Mayr, Richard}, Automatic verification of recursive procedures with one integer parameter, 198-211 [Zbl 1005.68096]  \\textit{Brosenne, Henrik; Homeister, Matthias; Waack, Stephan}, Graph-driven free parity BDDs: Algorithms and lower bounds, 212-223 [Zbl 0999.68068]  \\textit{Brattka, Vasco}, Computable versions of Baire's category theorem, 224-235 [Zbl 0999.03057]  \\textit{Bruy\u00e8re, V\u00e9ronique; Carton, Olivier}, Automata on linear orderings, 236-247 [Zbl 0999.68100]  \\textit{Cervelle, Julien; Durand, Bruno; Formenti, Enrico}, Algorithmic information theory and cellular automata dynamics, 248-259 [Zbl 0999.68091]  \\textit{Chrobak, Marek; Larmore, Lawrence L.; Rytter, Wojciech}, The \\(k\\)-median problem for directed trees (extended abstract), 260-271 [Zbl 0999.68536]  \\textit{Cryan, Mary; Miltersen, Peter Bro}, On pseudorandom generators in \\({\\mathbf {NC^0}}\\), 272-284 [Zbl 0999.68072]  \\textit{Cucker, Felipe; Grigoriev, Dima}, There are no sparse \\(\\text{NP}_W\\)-hard sets, 285-291 [Zbl 0999.68082]  \\textit{Di Crescenzo, Giovanni}, Sharing one secret vs. sharing many secrets: Tight bounds for the max improvement ratio, 292-303 [Zbl 1012.94553]  \\textit{D\u00edaz, Josep; Serna, Maria; Thilikos, Dimitrios M.}, (\\(H,C,K\\))-coloring: Fast, easy, and hard cases, 304-315 [Zbl 0999.68157]  \\textit{Downey, Rod G.; Hirschfeldt, Denis R.; LaForte, Geoff}, Randomness and reducibility, 316-327 [Zbl 0999.03038]  \\textit{\u010euri\u0161, Pavol; Ma\u0148uch, J\u00e1n}, On the computational complexity of infinite words, 328-337 [Zbl 0999.68105]  \\textit{Epstein, Leah; van Stee, Rob}, Lower bounds for on-line single-maschine scheduling, 338-350 [Zbl 0999.68502]  \\textit{Erlebach, Thomas}, Approximation algorithms and complexity results for path problems in trees of rings, 351-362 [Zbl 0999.68537]  \\textit{Espelage, Wolfgang; Wanke, Egon}, A 3-approximation algorithm for movement minimization in conveyor flow shop processing, 363-374 [Zbl 1003.90019]  \\textit{Fournier, Herv\u00e9}, Quantifier rank for parity of embedded finite models, 375-386 [Zbl 0999.03029]  \\textit{Geffert, Viliam}, Space hierarchy theorem revised, 387-397 [Zbl 1005.68073]  \\textit{Geffert, Viliam; Mereghetti, Carlo; Pighizzini, Giovanni}, Converting two-way nondeterministic unary automata into simpler automata, 398-407 [Zbl 1005.68090]  \\textit{Hoang, Thanh Minh; Thierauf, Thomas}, The complexity of the minimal polynomial, 408-420 [Zbl 0999.68263]  \\textit{Jir\u00e1skov\u00e1, Galina}, Note on minimal finite automata, 421-431 [Zbl 0999.68104]  \\textit{Kari, Jarkko}, Synchronizing finite automata on Eulerian digraphs, 432-438 [Zbl 0999.68108]  \\textit{Klein, Andreas; Kutrib, Martin}, A time hierarchy for bounded one-way cellular automata, 439-450 [Zbl 0999.68131]  \\textit{Klin, Bartek; Hoffman, Piotr; Tarlecki, Andrzej; Sch\u00f6der, Lutz; Mossakowski, Till}, Checking amalgamability conditions for CASL architectural specifications, 451-463 [Zbl 0999.68506]  \\textit{Koo, Chiu-Yuen; Lam, Tak-Wah; Ngan, Tsuen-Wan; To, Kar-Keung}, On-line scheduling with tight deadlines, 464-473 [Zbl 0999.68503]  \\textit{Kr\u00e1l, Daniel; Kratochv\u00edl, Jan; Voss, Heinz-J\u00fcrgen}, Complexity note on mixed hypergraphs, 474-485 [Zbl 1001.05055]  \\textit{Krumke, Sven O.; de Paepe, Willem E.; Poensgen, Diana; Stougie, Leen}, News from the online traveling repairman, 487-499 [Zbl 1003.90047]  \\textit{Lohrey, Markus}, Word problems for 2-homogeneous monoids and symmetric logspace, 500-511 [Zbl 0999.03037]  \\textit{Mignosi, Filippo; Shallit, Jeffrey; Wang, Ming-wei}, Variations on a theorem of Fine \\& Wilf, 512-523 [Zbl 0999.68166]  \\textit{Monien, Burkhard; Preis, Robert}, Upper bounds on the bisection width of 3- and 4-regular graphs, 524-536 [Zbl 0999.68159]  \\textit{Moore, Cristopher; Tesson, Pascal; Th\u00e9rien, Denis}, Satisfiability of systems of equations over finite monoids, 537-547 [Zbl 0999.68262]  \\textit{Morvan, Christophe; Stirling, Colin}, Rational graphs trace context-sensitive languages, 548-559 [Zbl 0999.68107]  \\textit{Neven, Frank; Schwentick, Thomas; Vianu, Victor}, Towards regular languages over infinite alphabets, 560-572 [Zbl 0999.68110]  \\textit{Nickelsen, Arfst}, Partial information and special case algorithms, 573-584 [Zbl 0999.68106]  \\textit{Ogihara, Mitsunori; Toda, Seinosuke}, The complexity of computing the number of self-avoiding walks in two-dimensional grid graphs and in hypercube graphs, 585-597 [Zbl 0999.68088]  \\textit{Piterman, Nir; Vardi, Moshe Y.}, From bidirectionality to alternation, 598-610 [Zbl 0999.68103]  \\textit{Pol\u00e1k, Libor}, Syntactic semiring of a language. (Extended abstract), 611-620 [Zbl 1005.68526]  \\textit{Pudl\u00e1k, Pavel}, On reducibility and symmetry of disjoint NP-pairs, 621-632 [Zbl 0999.68080]  \\textit{Rettinger, Robert; Zheng, Xizhong}, Hierarchy of monotonically computable real numbers (extended abstract), 633-644 [Zbl 0999.03510]  \\textit{Santocanale, Luigi}, On the equational definition of the least prefixed point, 645-656 [Zbl 0999.03026]  \\textit{Shur, Arseny M.; Konovalova, Yulia V.}, On the periods of partial words, 657-665 [Zbl 0999.68165]  \\textit{Sutner, Klaus}, The size of power automata, 666-677 [Zbl 0999.68109]  \\textit{Thimm, Martin}, On the approximability of the Steiner tree problem, 678-689 [Zbl 0999.68081]  \\textit{Wang, Zhuozhi; Zhang, Kaizhong}, Alignment between two RNA structures, 690-702 [Zbl 1070.92515]  \\textit{Wich, Klaus}, Characterization of context-free languages with polynomially bounded ambiguity, 703-714 [Zbl 0999.68101]","type":"string"},"datatype":"string"},"type":"statement","id":"Q5943786$9CA35807-FF6B-49CA-B72D-01B2A31C05E9","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5943786$0E7509E6-925C-43A0-A3A6-56CF15B5B3FA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5943786$DB8B4F79-0504-44F1-A713-35B634856F5F","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"55717d875dc16db0e1337e926666f0b8c7b34e21","datavalue":{"value":"1648465","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5943786$D9B22872-6781-4D2E-9B46-1DD2935CAEE7","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8eb88aa1a04167eb6adcb7debb98866d83c7ac69","datavalue":{"value":"Mari\u00e1nsk\u00e9 L\u00e1zn\u011b (Czech Republic)","type":"string"},"datatype":"string"},"type":"statement","id":"Q5943786$3023D454-9649-4A7C-8563-06149506FFEF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q5943786$FCCC98C5-3467-4936-9726-1B560A8D5F64","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1b165f2c80f889e3c73f8a20cfd816794dd15c80","datavalue":{"value":"Symposium","type":"string"},"datatype":"string"},"type":"statement","id":"Q5943786$D071C070-0FEB-4868-A83D-E1CEBBC282DF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c74691dba4fba153b088c6b63e7bb66119c8d3c3","datavalue":{"value":"MFCS 2001","type":"string"},"datatype":"string"},"type":"statement","id":"Q5943786$82E0D30F-2022-49AE-B6AB-6DD46C3FA921","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"fa78ad5518ca246bcf12a7a95d0f4aea27c592e5","datavalue":{"value":"Computer science","type":"string"},"datatype":"string"},"type":"statement","id":"Q5943786$4CA30A67-F66B-4888-88B4-5DE7AB28EAC2","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5943786$F92609C1-BF38-4EBA-B638-51A269FD91EE","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"3a8dcbbd7535e5bb446b5079e0d5d8fc7feef362","datavalue":{"value":"https://doi.org/10.1007/3-540-44683-4","type":"string"},"datatype":"url"},"type":"statement","id":"Q5943786$6786370E-D848-4A71-A338-0E8782ABDF17","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"6f5dae45abb0c9c2b4cb608de032fad302f1de4a","datavalue":{"value":"W2499526401","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5943786$DE1A6555-AA9E-4A6B-810B-3052AD3DD0CC","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:5943786","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:5943786"}}}}}