{"entities":{"Q1899993":{"pageid":1910735,"ns":120,"title":"Item:Q1899993","lastrevid":73723377,"modified":"2026-04-14T17:02:46Z","type":"item","id":"Q1899993","labels":{"en":{"language":"en","value":"Mathematical foundations of computer science 1995. 20th international symposium, MFCS '95, Prague, Czech Republic, August 28-September 1, 1995. Proceedings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 805919"}},"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":"Q1899993$CFB33B04-25A0-4283-8932-9FF2FB078072","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"cdb83c664277dbe8c80d4b6dafbeae1d21470eae","datavalue":{"value":{"text":"Mathematical foundations of computer science 1995. 20th international symposium, MFCS '95, Prague, Czech Republic, August 28-September 1, 1995. Proceedings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1899993$97DEB308-A984-4F4C-94D6-4DF5B083EFD4","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"1d3f63a2cbc44a84e1ca949554d3dee1adafbd4b","datavalue":{"value":"0847.00052","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1899993$15FEFCB5-006B-456A-B9E3-31A966159579","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"850aa9d8a8245be3b85935e8d99fb0a6e1abde13","datavalue":{"value":"10.1007/3-540-60246-1","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1899993$D8BFBFC9-184F-495C-99DF-A8329F025ACD","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":"Q1899993$B81283A5-B791-4569-A6BB-9B218E2A3EA1","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"5b68e4da85feecb65bde1c982d147892bbd6cdd4","datavalue":{"value":{"time":"+1995-10-16T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1899993$5D60FE1C-C061-4090-9AB7-5F690D9F7ABE","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"8a9dcc8a54699fb674dec4ce6e4b5f0edd0c512a","datavalue":{"value":"The articles of this volume will be reviewed individually. The 15th international symposium (1990) has been reviewed (see Zbl 0776.00038).  Indexed articles:  \\textit{Adler, Micah; Byers, John W.; Karp, Richard M.}, Scheduling parallel communication: The \\(h\\)-relation problem, 1-20 [Zbl 1193.68054]  \\textit{Arnborg, Stefan}, Decomposable structures, Boolean function representations, and optimization, 21-36 [Zbl 1193.68184]  \\textit{Flammini, Michele; van Leeuwen, Jan; Marchetti-Spaccamela, Alberto}, The complexity of interval routing on random graphs, 37-49 [Zbl 1193.68189]  \\textit{Geffert, Viliam}, Bridging across the \\(\\log (n)\\) space frontier, 50-65 [Zbl 1193.68114]  \\textit{Gottlob, Georg; Leone, Nicola; Veith, Helmut}, Second order logic and the weak exponential hierarchies, 66-81 [Zbl 1193.68115]  \\textit{Hartmanis, Juris}, On the computing paradigm and computational complexity, 82-92 [Zbl 1193.68116]  \\textit{Perrin, Dominique}, Symbolic dynamics and finite automata, 94-104 [Zbl 1193.68157]  \\textit{Vit\u00e1nyi, Paul}, Physics and the new computation, 106-128 [Zbl 1193.68110]  \\textit{Allender, Eric; Strauss, Martin}, Measure on P: Robustness of the notion, 129-138 [Zbl 1193.68111]  \\textit{Burtschick, Hans-J\u00f6rg}, Comparing counting classes for logspace, one-way logspace, and first-order, 139-148 [Zbl 1193.68113]  \\textit{Damm, Carsten; Holzer, Markus}, Automata that take advice, 149-158 [Zbl 1193.68152]  \\textit{Homer, Steven; Mocas, Sarah}, Nonuniform lower bounds for exponential time classes, 159-168 [Zbl 1188.68145]  \\textit{Kaufmann, Susanne; Kummer, Martin}, On a quantitative notion of uniformity, 169-178 [Zbl 1193.68117]  \\textit{Merkle, Wolfgang; Wang, Yongge}, Separations by random oracles and ``almost'' classes for generalized reducibilities, 179-190 [Zbl 1193.03071]  \\textit{Beauquier, Dani\u00e8le; Burago, Dima; Slissenko, Anatol}, On the complexity of finite memory policies for Markov decision processes, 191-200 [Zbl 1193.68126]  \\textit{Hofmeister, Thomas; Lefmann, Hanno}, Derandomization for sparse approximations and independent sets, 201-210 [Zbl 1193.68133]  \\textit{Katajainen, Jyrki; Pasanen, Tomi; Titan, George}, Asymptotically efficient in-place merging, 211-220 [Zbl 1193.68282]  \\textit{Heusch, Peter}, The complexity of the falsifiability problem for pure implicational formulas, 221-226 [Zbl 1193.68132]  \\textit{Kann, Viggo}, Strong lower bounds on the approximability of some NPO PB-complete maximization problems, 227-236 [Zbl 1193.68120]  \\textit{Lefmann, Hanno; Savick\u00fd, Petr}, Some typical properties of large AND/OR Boolean formulas, 237-246 [Zbl 1193.03018]  \\textit{H\u00fchne, Martin}, The hedge: an efficient storage device for Turing machines with one head, 247-256 [Zbl 1193.68109]  \\textit{Maruyama, Osamu; Miyano, Satoru}, Graph inference from a walk for trees of bounded degree 3 is NP-complete, 257-266 [Zbl 1193.68197]  \\textit{Stojmenovi\u0107, Ivan}, Honeycomb networks, 267-276 [Zbl 1193.68039]  \\textit{Fischer, Sophie; Hemaspaandra, Lane; Torenvliet, Leen}, Witness-isomorphic reductions and the local search problem (extended abstract), 277-287 [Zbl 1193.03070]  \\textit{Bertram-Kretzberg, Claudia; Hofmeister, Thomas}, Multiple product modulo arbitrary numbers, 288-298 [Zbl 1193.68127]  \\textit{Meinel, Christoph; Waack, Stephan}, Lower bounds for the majority communication complexity of various graph accessibility problems, 299-308 [Zbl 1193.68137]  \\textit{Bertoni, Alberto; Mereghetti, Carlo; Pighizzini, Giovanni}, Strong optimal lower bounds for Turing machines that accept nonregular languages, 309-318 [Zbl 1193.68119]  \\textit{\u017d\u00e1k, Stanislav}, A superpolynomial lower bound for \\((1,+k(n))\\)-branching programs, 319-325 [Zbl 1193.68121]  \\textit{Breveglieri, Luca; Cherubini, Alessandra; Reghizzi, Stefano Crespi}, Deterministic parsing for augmented context-free grammars, 326-336 [Zbl 1193.68144]  \\textit{Mignosi, Filippo; Restivo, Antonio; Salemi, Sergio}, A periodicity theorem on words and applications, 337-348 [Zbl 1193.68202]  \\textit{Hotz, G\u00fcnter; Pitsch, Gisela}, A new approach to analyse coupled-context-free languages, 349-358 [Zbl 1193.68153]  \\textit{Hermann, Miki; Kolaitis, Phokion G.}, Computational complexity of simultaneous elementary matching problems, 359-370 [Zbl 1193.03027]  \\textit{Krishna Rao, M. R. K.}, Graph reducibility of term rewriting systems, 371-381 [Zbl 1193.68147]  \\textit{Urzyczyn, Pawel}, Positive recursive type assignment, 382-391 [Zbl 1193.68076]  \\textit{Kranakis, Evangelos; Krizanc, Danny; Luccio, Flaminia L.}, String recognition on anonymous rings, 392-401 [Zbl 1193.68292]  \\textit{R\u00f3ka, Zsuzsanna}, The firing squad synchronization problem on Cayley graphs, 402-411 [Zbl 1193.68170]  \\textit{Sibeyn, Jop F.; Kaufmann, Michael}, Solving cheap graph problems on meshes, 412-422 [Zbl 1193.68199]  \\textit{Burkart, Olaf; Caucal, Didier; Steffen, Bernhard}, An elementary bisimulation decision procedure for arbitrary context-free processes, 423-433 [Zbl 1193.68172]  \\textit{Bauget, Serge; Gastin, Paul}, On congruences and partial orders, 434-443 [Zbl 1193.68171]  \\textit{Corradini, Flavio; Gorrieri, Roberto; Roccetti, Marco}, Performance preorder: ordering processes with respect to speed, 444-453 [Zbl 1193.68173]  \\textit{Ferreira, W.; Hennessy, M.}, Towards a semantic theory of CML, 454-466 [Zbl 1193.68068]  \\textit{Huguet, S\u00e9bastien; Petit, Antoine}, Modular constructions of distributing automata, 467-478 [Zbl 1193.68154]  \\textit{Sangiorgi, Davide}, On the proof method for bisimulation, 479-488 [Zbl 1193.68177]  \\textit{Martin, Clare}, Towards a calculus of predicate transformers, 489-498 [Zbl 1193.68165]  \\textit{Abadi, Mart\u00edn; Merz, Stephan}, An abstract account of composition, 499-508 [Zbl 1193.68159]  \\textit{van der Goot, Roel; de Bruin, Arie}, Syntax and semantics of Procol, 509-518 [Zbl 1193.68072]  \\textit{Godskesen, Jens Chr.; Larsen, Kim G.}, Synthesizing distinguishing formulae for real time systems -- extended abstract, 519-528 [Zbl 1193.68162]  \\textit{Laroussinie, Fran\u00e7ois; Larsen, Kim G.; Weise, Carsten}, From timed automata to logic -- and back, 529-539 [Zbl 1193.03069]  \\textit{Makowsky, J. A.; Ravve, E. V.}, Incremental model checking for decomposable structures, 540-551 [Zbl 1193.68164]  \\textit{Janin, David; Walukiewicz, Igor}, Automata for the modal \\(\\mu \\)-calculus and related results, 552-562 [Zbl 1193.68163]  \\textit{Niebert, Peter}, A \\(\\nu \\)-calculus with local views for systems of sequential agents, 563-573 [Zbl 1193.68166]  \\textit{Feinsilver, P.; Schott, R.}, An operator calculus approach to the evolution of dynamic data structures, 574-586 [Zbl 1193.68084]","type":"string"},"datatype":"string"},"type":"statement","id":"Q1899993$30E5A568-677D-4761-8658-BD3DD215149C","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1899993$86494D5C-571D-4135-80B6-991EFD1007C9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1899993$C70D86F4-E3F1-4957-B328-36BE562F7D38","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"f969879f531643f058f8dd4c87a7dd4eb7b8c4c8","datavalue":{"value":"68Qxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1899993$BDC2A70E-4813-4D03-93BF-DFFB53E29C88","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"41f39c9cd4907b6f732fafa6516308dd5a5e5b7c","datavalue":{"value":"805919","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1899993$55CCFF80-0EF4-4941-B05F-7615C30422E9","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"fa78ad5518ca246bcf12a7a95d0f4aea27c592e5","datavalue":{"value":"Computer science","type":"string"},"datatype":"string"},"type":"statement","id":"Q1899993$43D766B6-550F-4FC0-8C95-4F06D7B37CCC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1b165f2c80f889e3c73f8a20cfd816794dd15c80","datavalue":{"value":"Symposium","type":"string"},"datatype":"string"},"type":"statement","id":"Q1899993$67541D48-7E8F-43A0-A6A5-B8B52DB3013A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q1899993$592753BF-C5CB-4564-BBEE-E7AFD63FAEE9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c0aa30c9bbca6402d32c13a132971934631af137","datavalue":{"value":"Prague (Czech Republic)","type":"string"},"datatype":"string"},"type":"statement","id":"Q1899993$AD939F7F-4253-47B6-9E88-B318A786C0E6","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":"Q1899993$70995406-9CC3-4682-9E8F-D201EE59CFB7","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"ca969dd681f5b10b9afb96b93337e3ee6d67f37a","datavalue":{"value":"https://doi.org/10.1007/3-540-60246-1","type":"string"},"datatype":"url"},"type":"statement","id":"Q1899993$F06996DB-F758-47F6-A523-629C58AEB468","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"f5f395539a4424dcdc3ec227c644f7ecbf524ffd","datavalue":{"value":"W2615186128","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1899993$1A66E733-D28F-4AE2-85B2-08BCDD409B9A","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Mathematical foundations of computer science 1995. 20th international symposium, MFCS '95, Prague, Czech Republic, August 28-September 1, 1995. Proceedings","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Mathematical_foundations_of_computer_science_1995._20th_international_symposium,_MFCS_%2795,_Prague,_Czech_Republic,_August_28-September_1,_1995._Proceedings"}}}}}