Jir i. Wiedermann Livres

This collection features a range of topics in computer science and technology, including invited talks and regular papers. It explores how nature can aid computation, the evolution of ontologies, and visual web wrapper generators. Discussions on future European ICT R&D and selfish routing in networks are included, alongside insights into new physics and hypercomputation. The papers cover models and algorithms for wireless sensor networks, semantic web advancements, and mobility in wireless networks. Key research includes data reduction schemes for graph domination, incremental methods for XML view maintenance, and constructing interference-minimal networks. The complexity of various algorithms is examined, such as those for sorting Fibonacci string rotations and optimal memory rendezvous for mobile agents. Other contributions address reasoning in inconsistent concurrent systems and the development of a personalized recommendation system for e-commerce. The collection also delves into database management with topics like XML databases, reliable broadcasting, and fuzzy transformation systems. It discusses web mining techniques to enhance websites and presents frameworks for message passing and UML refinement patterns. Additionally, it addresses the computational complexity of relay placement in sensor networks and presents innovative digital signature methods. Overall, this compilation reflects significant advancements and o

This book constitutes the refereed proceedings of the 26th International Colloquium on Automata, Languages and Programming, ICALP'99, held in Prague, Czech Republic, in July 1999. The 56 revised full papers presented were carefully reviewed and selected from a total of 126 submissions; also included are 11 inivited contributions. Among the topics addressed are approximation algorithms, algebra and circuits, concurrency, semantics and rewriting, process algebras, graphs, distributed computing, logic of programs, sorting and searching, automata, nonstandard computing, regular languages, combinatorial optimization, automata and logics, string algorithms, and applied logics.

This book presents the proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science, MFCS'95, held in Prague, Czech Republic in August/September 1995. The book contains eight invited papers and two abstracts of invited talks by outstanding scientists as well as 44 revised full research papers selected from a total of 104 submissions. All relevant aspects of theoretical computer science are addressed, particularly the mathematical foundations; the papers are organized in sections on structural complexity, algorithms, complexity theory, graphs in models of computation, lower bounds, formal languages, unification, rewriting and type theory, distributed computation, concurrency, semantics, model checking, and formal calculi.