{"entities":{"Q1414356":{"pageid":1425096,"ns":120,"title":"Item:Q1414356","lastrevid":68648682,"modified":"2026-04-13T01:10:30Z","type":"item","id":"Q1414356","labels":{"en":{"language":"en","value":"Mathematical foundations of computer science 2003. 28th international symposium, MFCS 2003, Bratislava, Slovakia, August 25--29, 2003. Proceedings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2006443"}},"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":"Q1414356$FD9D8B50-797F-48CF-9F04-7416BECBD6CB","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"2ffc8738fc7956c4041dbe355dabd477f4518180","datavalue":{"value":{"text":"Mathematical foundations of computer science 2003. 28th international symposium, MFCS 2003, Bratislava, Slovakia, August 25--29, 2003. Proceedings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1414356$E0F48331-1382-4F57-A19B-2FAEEF91E0A0","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"cce7dea2988635f589e44da701ae02c05bc82ac9","datavalue":{"value":"1025.00004","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1414356$C9EB1C35-D6D2-46B5-B322-FCC33DD35DAE","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":"Q1414356$C2407A87-0B1E-42ED-B3A0-B8AF3CA64DCD","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"57a85b978605e92a5cbf995df34cb443c18c900b","datavalue":{"value":{"time":"+2003-11-20T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1414356$47108D58-219F-4CBC-9F0B-C59DDD685F6C","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"8083750b60a38636e0bc54a460a0167e0ab5c450","datavalue":{"value":"http://link.springer.de/link/service/series/0558/tocs/t2747.htm","type":"string"},"datatype":"url"},"type":"statement","id":"Q1414356$868CB118-2989-48E0-8473-545D20358251","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"ac6d805015a471a188811d3b88a4fe069371a5a7","datavalue":{"value":"The articles of this volume will be reviewed individually. The preceding symposium has been reviewed (see Zbl 0997.00033).  Indexed articles:  \\textit{Buhrman, Harry; R\u00f6hrig, Hein}, Distributed quantum computing, 1-20 [Zbl 1124.68361]  \\textit{Feldmann, R.; Gairing, M.; L\u00fccking, Thomas; Monien, Burkhard; Rode, Manuel}, Selfish routing in non-cooperative networks: A survey, 21-45 [Zbl 1124.68305]  \\textit{Gorrieri, Roberto; Martinelli, Fabio}, Process algebraic frameworks for the specification and analysis of cryptographic protocols, 46-67 [Zbl 1124.94302]  \\textit{Hannay, Jo; Katsumata, Shin-ya; Sannella, Donald}, Semantic and syntactic approaches to simulation relations, 68-91 [Zbl 1124.68342]  \\textit{Mauri, Giancarlo; Leporati, Alberto}, On the computational complexity of conservative computing, 92-112 [Zbl 1124.68363]  \\textit{Thomas, Wolfgang}, Constructing infinite graphs with a decidable MSO-theory, 113-124 [Zbl 1124.03314]  \\textit{Wegener, Ingo}, Towards a theory of randomized search heuristics, 125-141 [Zbl 1124.68434]  \\textit{\u00c0lvarez, C.; Blesa, M.; D\u00edaz, J.; Fern\u00e1ndez, A.; Serna, M.}, Adversarial models for priority-based networks, 142-151 [Zbl 1124.68301]  \\textit{Amano, Kazuyuki; Maruoka, Akira}, On optimal merging networks, 152-161 [Zbl 1124.68350]  \\textit{Ambos-Spies, Klaus}, Problems which cannot be reduced to any proper subproblems, 162-168 [Zbl 1124.03323]  \\textit{Anantharaman, Siva; Narendran, Paliath; Rusinowitch, Michael}, ACID-unification is NEXPTIME-decidable, 169-178 [Zbl 1124.68370]  \\textit{Ausiello, G.; Bazgan, C.; Demange, M.; Paschos, V. Th.}, Completeness in differential approximation classes, 179-188 [Zbl 1124.68365]  \\textit{Baba, Kensuke; Tsuruta, Satoshi; Shinohara, Ayumi; Takeda, Masayuki}, On the length of the minimum solution of word equations in one variable, 189-197 [Zbl 1124.68404]  \\textit{Banderier, Cyril; Beier, Ren\u00e9; Mehlhorn, Kurt}, Smoothed analysis of three combinatorial problems, 198-207 [Zbl 1124.68371]  \\textit{Bannai, Hideo; Inenaga, Shunsuke; Shinohara, Ayumi; Takeda, Masayuki}, Inferring strings from graphs and arrays, 208-217 [Zbl 1124.68348]  \\textit{Benkoczi, Robert; Bhattacharya, Binay; Chrobak, Marek; Larmore, Lawrence L.; Rytter, Wojciech}, Faster algorithms for \\(k\\)-medians in trees, 218-227 [Zbl 1124.68452]  \\textit{Blanchard, F.; Cervelle, J.; Formenti, E.}, Periodicity and transitivity for cellular automata in Besicovitch topologies, 228-238 [Zbl 1124.68390]  \\textit{Bodlaender, Hans L.; Fellows, Michael R.; Thilikos, Dimitrios M.}, Starting with nondeterminism: The systematic derivation of linear-time graph layout algorithms, 239-248 [Zbl 1124.68397]  \\textit{B\u00f6hler, Elmar; Gla\u00dfer, Christian; Meister, Daniel}, Error-bounded probabilistic computations between MA and AM, 249-258 [Zbl 1124.68366]  \\textit{Bonsma, Paul S.; Brueggemann, Tobias; Woeginger, Gerhard J.}, A faster FPT algorithm for finding spanning trees with many leaves, 259-268 [Zbl 1124.68398]  \\textit{Boreale, Michele; Buscemi, Maria Grazia}, Symbolic analysis of crypto-protocols based on modular exponentiation, 269-278 [Zbl 1124.94301]  \\textit{Boreale, Michele; Gadducci, Fabio}, Denotational testing semantics in coinductive form, 279-289 [Zbl 1124.68383]  \\textit{Brosenne, Henrik; Homeister, Matthias; Waack, Stephan}, Lower bounds for general graph-driven read-once parity branching programs, 290-299 [Zbl 1124.68360]  \\textit{Bucciarelli, Antonio; Salibra, Antonino}, The minimal graph model of lambda calculus, 300-307 [Zbl 1124.03315]  \\textit{Carton, Olivier}, Unambiguous automata on bi-infinite words, 308-317 [Zbl 1124.68379]  \\textit{\u010cern\u00e1, Ivana; Pel\u00e1nek, Radek}, Relating hierarchy of temporal properties to model checking, 318-327 [Zbl 1124.68385]  \\textit{Chen, Hubie}, Arithmetic constant-depth circuit complexity classes, 328-337 [Zbl 1124.68367]  \\textit{Chen, Hubie}, Inverse NP problems, 338-347 [Zbl 1124.68368]  \\textit{Chen, Zhi-Zhong; Kouno, Mitsuharu}, A linear-time algorithm for 7-coloring 1-planar graphs, 348-357 [Zbl 1124.68400]  \\textit{Dalmau, Victor; Ford, Daniel K.}, Generalized satisfiability with limited occurrences per variable: A study through delta-matroid parity, 358-367 [Zbl 1124.68372]  \\textit{De Marco, Gianluca; Pelc, Andrzej}, Randomized algorithms for determining the majority on graphs, 368-377 [Zbl 1124.68401]  \\textit{Delhomm\u00e9, Christian; Knapik, Teodor; Thomas, D. Gnanaraj}, Using transitive-closure logic for deciding linear properties of monoids, 378-387 [Zbl 1124.03313]  \\textit{Duval, Jean-Pierre; Kolpakov, Roman; Kucherov, Gregory; Lecroq, Thierry; Lefebvre, Arnaud}, Linear-time computation of local periods, 388-397 [Zbl 1124.68405]  \\textit{Epstein, Leah}, Two dimensional packing: The power of rotation, 398-407 [Zbl 1124.68431]  \\textit{Epstein, Leah; Tassa, Tamir}, Approximation schemes for the min-max starting time problem, 408-418 [Zbl 1124.68328]  \\textit{Friedl, Katalin; Magniez, Fr\u00e9d\u00e9ric; Santha, Miklos; Sen, Pranab}, Quantum testers for hidden group properties, 419-428 [Zbl 1124.68362]  \\textit{Gastin, Paul; Mukund, Madhavan; Kumar, K. Narayan}, Local LTL with past constants is expressively complete for Mazurkiewicz traces, 429-438 [Zbl 1124.68391]  \\textit{Gastin, Paul; Oddoux, Denis}, LTL with past and two-way very-weak alternating automata, 439-448 [Zbl 1124.68387]  \\textit{Geser, Alfons; Hofbauer, Dieter; Waldmann, Johannes}, Match-bounded string rewriting systems, 449-459 [Zbl 1124.68378]  \\textit{Gramlich, Gregor}, Probabilistic and nondeterministic unary automata, 460-469 [Zbl 1124.68381]  \\textit{Hlin\u011bn\u00fd, Petr}, On matroid properties definable in the MSO logic, 470-479 [Zbl 1124.68373]  \\textit{Ibarra, Oscar H.; Dang, Zhe; Egecioglu, Omer; Saxena, Gaurav}, Characterizations of catalytic membrane computing systems, 480-489 [Zbl 1124.68364]  \\textit{Ishii, Toshimasa; Hagiwara, Masayuki}, Augmenting local edge-connectivity between vertices and vertex subsets in undirected graphs, 490-499 [Zbl 1124.68403]  \\textit{Krysta, Piotr; Sanders, Peter; V\u00f6cking, Berthold}, Scheduling and traffic allocation for tasks with bounded splittability, 500-510 [Zbl 1124.68329]  \\textit{Kuty\u0142owski, Miros\u0142aw; Letkiewicz, Daniel}, Computing average value in ad hoc networks, 511-520 [Zbl 1124.68311]  \\textit{Lasota, S\u0142awomir}, A polynomial-time algorithm for deciding true concurrency equivalences of basic parallel processes, 521-530 [Zbl 1124.68392]  \\textit{L\u00f6ding, Christof; Rohde, Philipp}, Solving the sabotage game is PSPACE-hard, 531-540 [Zbl 1124.68369]  \\textit{Loyer, Yann; Straccia, Umberto}, The approximate well-founded semantics for logic programs with uncertainty, 541-550 [Zbl 1124.68339]  \\textit{L\u00fccking, Thomas; Mavronicolas, Marios; Monien, Burkhard; Rode, Manuel; Spirakis, Paul; Vrto, Imrich}, Which is the worst-case Nash equilibrium?, 551-561 [Zbl 1124.68330]  \\textit{Luttik, Bas}, A unique decomposition theorem for ordered monoids with applications in process theory, 562-571 [Zbl 1124.68393]  \\textit{Mart\u00ednez, Conrado; Molinero, Xavier}, Generic algorithms for the generation of combinatorial objects, 572-581 [Zbl 1124.68396]  \\textit{Meer, K.}, On the complexity of some problems in interval arithmetic, 582-591 [Zbl 1124.65300]  \\textit{Meghini, Carlo; Tzitzikas, Yannis; Spyratos, Nicolas}, An abduction-based method for index relaxation in taxonomy-based sources, 592-601 [Zbl 1124.68437]  \\textit{Merkle, Wolfgang; Reimann, Jan}, On selection functions that do not preserve normality, 602-611 [Zbl 1124.68382]  \\textit{Miltersen, Peter Bro; Radhakrishnan, Jaikumar; Wegener, Ingo}, On converting CNF to DNF, 612-621 [Zbl 1124.06302]  \\textit{Pisanti, N.; Crochemore, M.; Grossi, R.; Sagot, M.-F.}, A basis of tiling motifs for generating repeated patterns and its complexity for higher quorum, 622-631 [Zbl 1124.68454]  \\textit{Reith, Steffen}, On the complexity of some equivalence problems for propositional calculi, 632-641 [Zbl 1124.68375]  \\textit{Riedweg, St\u00e9phane; Pinchinat, Sophie}, Quantified mu-calculus for control synthesis, 642-651 [Zbl 1124.68388]  \\textit{Rychlik, Marcin}, On probabilistic quantified satisfiability games, 652-661 [Zbl 1124.68376]  \\textit{Salehi, Saeed}, A completeness property of Wilke's tree algebras, 662-670 [Zbl 1124.68389]  \\textit{Woelfel, Philipp}, Symbolic topological sorting with OBDDs, 671-680 [Zbl 1124.68352]  \\textit{Zheng, Xizhong; Rettinger, Robert; Gengler, Romain}, Ershov's hierarchy of real numbers, 681-690 [Zbl 1124.03324]","type":"string"},"datatype":"string"},"type":"statement","id":"Q1414356$4F7D563E-7EB9-40AA-8B71-0B2B9568D0D7","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1414356$10C0EF67-DD27-44BA-8258-687F556F91DE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1414356$D1C7199C-8394-402E-85B3-1CB378CDDEBC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"f969879f531643f058f8dd4c87a7dd4eb7b8c4c8","datavalue":{"value":"68Qxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1414356$CE630D93-4629-4199-8758-1F0CB8055C6E","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"1db3ca1f38b5c28ee4992be8b8e7f50aee0807fa","datavalue":{"value":"2006443","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1414356$50A839AC-E34B-4C77-8673-E73B20221B20","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"fa78ad5518ca246bcf12a7a95d0f4aea27c592e5","datavalue":{"value":"Computer science","type":"string"},"datatype":"string"},"type":"statement","id":"Q1414356$6E689C13-9E98-46A3-9C55-066910D751E9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"af7238066e52a522a18242c34a730522042a955a","datavalue":{"value":"Bratislava (Slovakia)","type":"string"},"datatype":"string"},"type":"statement","id":"Q1414356$D18DE1AA-DD84-4A95-BB38-63A59219711A","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":"Q1414356$B22C6E3E-53D6-447B-A49B-BC5CC38C4D63","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"72e34da507db8c9ca2948992ad066b5961d57806","datavalue":{"value":"W2495578842","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1414356$6EE002D9-02EE-4DB9-A24B-C1162583E7CD","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"3aa735e939555ae4cb416c369c1669b99c7d34c0","datavalue":{"value":"10.1007/B11836","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1414356$A2A72F05-3657-49A3-9B4A-1BFEF7BABBC5","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Mathematical foundations of computer science 2003. 28th international symposium, MFCS 2003, Bratislava, Slovakia, August 25--29, 2003. Proceedings","badges":[]}}}}}