Kutyłowski, Mirosław (ed.); Pacholski, Leszek (ed.); Wierzbicki, Tomasz (ed.) Mathematical foundations of computer science 1999. 24th international symposium, MFCS ’99, Szklarska Porȩba, Poland, September 6–10, 1999. Proceedings. (English) Zbl 0921.00031 Lecture Notes in Computer Science. 1672. Berlin: Springer. xii, 455 p. (1999). Show indexed articles as search result. The articles of mathematical interest will be reviewed individually. The preceding symposium (23, 1998) has been indicated (see Zbl 0895.00049).Indexed articles:Frougny, Christiane, On-line addition in real base, 1-11 [Zbl 0955.68130]Meer, Klaus, Query languages for real number databases based on descriptive complexity over \(R\), 12-22 [Zbl 0956.68049]Zheng, Xizhong; Weihrauch, Klaus, The arithmetical hierarchy of real numbers, 23-33 [Zbl 0955.03066]Manzini, Giovanni, The Burrows-Wheeler transform: Theory and practice, 34-47 [Zbl 1038.94518]Gąsieniec, Leszek; Gibbons, Alan; Rytter, Wojciech, Efficiency of fast parallel pattern searching in highly compressed texts, 48-58 [Zbl 0980.68031]Loyer, Yann; Spyratos, Nicolas; Stamate, Daniel, Computing and comparing semantics of programs in four-valued logics, 59-69 [Zbl 0947.03046]Mosses, Peter D., Foundations of modular SOS, 70-80 [Zbl 0955.68075]Muscholl, Anca; Peled, Doron, Message sequence graphs and decision problems on Marzurkiewicz traces, 81-91 [Zbl 0955.68084]Durand, Arnaud; Hermann, Miki; Juban, Laurent, On the complexity of recognizing the Hilbert basis of a linear Diophantine system, 92-102 [Zbl 1024.11013]Havas, George; Seifert, Jean-Pierre, The complexity of the extended GCD problem, 103-113 [Zbl 0996.11077]Lohrey, Markus, Complexity results for confluence problems, 114-124 [Zbl 0955.68063]Aceto, Luca; Laroussinie, François, Is your model checker on time? On the complexity of model checking for timed modal logics, 125-136 [Zbl 0955.68079]Bolotov, Alexander; Dixon, Clare; Fisher, Michael, Clausal resolution for CTL*, 137-148 [Zbl 0947.03044]Hungar, Hardi, Model checking and higher-order recursion, 149-159 [Zbl 0961.68083]Maňuch, Ján, Multiparty communication complexity: Very hard functions, 160-169 [Zbl 0956.68067]Herlihy, Maurice; Rajsbaum, Sergio, New perspectives in distributed computing. (Invited lecture), 170-186 [Zbl 0958.68504]Grudziński, Grzegorz, An improved disjunctive strictness analysis for lazy functional languages, 187-197 [Zbl 0956.68025]Lassen, Søren B.; Moran, Andrew, Unique fixed point induction for McCarthy’s amb, 198-208 [Zbl 0955.68023]Margara, Luciano, On some topological properties of linear cellular automata, 209-219 [Zbl 0956.68092]Nakamura, Katsuhiko, Real-time language recognition by one-way and two-way cellular automata, 220-230 [Zbl 0956.68093]Nicaud, Cyril, Average state complexity of operations on unary automata, 231-240 [Zbl 0955.68068]Petersen, Holger, Fooling rebound automata, 241-250 [Zbl 0956.68519]Sieling, Detlef, The complexity of minimizing FBDDs. (Extended abstract), 251-261 [Zbl 0955.68090]Woelfel, Philipp, Efficient strongly universal and optimally universal hashing. (Extended abstract), 262-272 [Zbl 0955.68035]Cīrulis, Jānis, An algebraic approach to knowledge representation, 299-309 [Zbl 0955.68106]Janin, D.; Lenzi, G., On the structure of the monadic logic of the binary tree, 310-320 [Zbl 0943.03033]Nguyen, Linh Anh, A new space bound for the modal logics K4, KD4 and S4, 321-331 [Zbl 0943.03018]Gambin, Anna, On approximating the number of bases of exchange preserving matroids, 332-342 [Zbl 0945.05012]de Boer, F. S.; de Roever, W.-P.; Hannemann, U., The semantic foundations of a compositional proof method for synchronously communicating processes, 343-353 [Zbl 0959.68086]Fröschle, Sibylle B.; Hildebrandt, Thomas T., On plain and hereditary history-preserving bisimulation, 354-365 [Zbl 0959.68087]Stříbrná, Jitka, Approximating weak bisimulation on basic process algebras, 366-375 [Zbl 0959.68088]Caragiannis, Ioannis; Kaklamanis, Christos; Persiano, Pino, Edge coloring of bipartite graphs with constraints, 376-386 [Zbl 0945.05024]Fernau, Henning; Niedermeier, Rolf, An efficient exact algorithm for constraint bipartite vertex cover, 387-397 [Zbl 0945.05055]Bernholt, Thorsten; Gülich, Alexander; Hofmeister, Thomas; Schmitt, Niels, Football elimination is hard to decide under the 3-point-rule. (Extended abstract), 410-418 [Zbl 0948.90560]Hertrampf, Ulrich, Generalized regular counting classes, 419-429 [Zbl 0955.68055]Yamakami, Tomoyuki, A foundation of programming a multi-tape quantum Turing machine, 430-441 [Zbl 0955.68048] Cited in 3 Reviews MSC: 00B25 Proceedings of conferences of miscellaneous specific interest 68-06 Proceedings, conferences, collections, etc. pertaining to computer science Keywords:Szklarska Porȩba (Poland); Proceedings; Symposium; MFCS ’99; Computer science Citations:Zbl 0895.00049 PDFBibTeX XMLCite \textit{M. Kutyłowski} (ed.) et al., Mathematical foundations of computer science 1999. 24th international symposium, MFCS '99, Szklarska Porȩba, Poland, September 6--10, 1999. Proceedings. Berlin: Springer (1999; Zbl 0921.00031) Full Text: DOI