Annotation This book constitutes the refereed proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007, held in Cesk?? Krumlov, Czech Republic, August 26-31, 2007. The 61 revised full papers presented together with the full papers or abstracts of 5 invited talks were carefully reviewed and selected from 167 submissions. All current aspects in theoretical computer science and its mathematical foundations are addressed, ranging from algorithms and data structures, to complexity, automata, semantics, logic, formal specifications, models of computation, concurrency theory, computational geometry, parallel and distributed computing, networks, bioinformatics, quantum computing, cryptography, knowledge-based systems, and artificial intelligence32nd International Symposium, MFCS 2007 CeskA½ Krumlov, Czech Republic, August 26-31, 2007, Proceedings Ludek Kucera, AntonAsn Kucera. 4ProblemPMGI . In Section 3, wehavepresented an efficient index data structure, namely IDSPMI, to solve Problem PMI. ... minimum (maximum, in the case of Range Maxima Query) value A[k] for k a I. Problem RMIN has received much attention in the literatureanbsp;...
|Title||:||Mathematical Foundations of Computer Science 2007|
|Author||:||Ludek Kucera, Antonín Kucera|
|Publisher||:||Springer Science & Business Media - 2007-08-15|