From post

SOFSEM 2007: Theory and Practice of Computer Science, 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings

, , , , , и (Ред.) том 4362 из Lecture Notes in Computer Science, Springer, (2007)
DOI: 10.1007/978-3-540-69507-3

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Concurrent Algorithms and Data Types Animation over the Internet., , , и . IFIP Congress: Fundamentals - Foundations of Computer Science, том 117 из books@ocg.at, стр. 63-80. Austrian Computer Society, (1998)Sorting and searching in the presence of memory faults (without redundancy)., и . STOC, стр. 101-110. ACM, (2004)A new approach to dynamic all pairs shortest paths., и . STOC, стр. 159-166. ACM, (2003)Getting Back to the Past in the Union-Find Problem., , и . STACS, том 294 из Lecture Notes in Computer Science, стр. 8-17. Springer, (1988)On Suffix Extensions in Suffix Trees., и . SPIRE, том 7024 из Lecture Notes in Computer Science, стр. 301-312. Springer, (2011)Dynamic 2- and 3-Connectivity on Planar Graphs (Preliminary Version)., и . SWAT, том 621 из Lecture Notes in Computer Science, стр. 221-232. Springer, (1992)Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract)., и . ICALP, том 1256 из Lecture Notes in Computer Science, стр. 605-615. Springer, (1997)Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments., , , , и . ESA, том 4698 из Lecture Notes in Computer Science, стр. 605-617. Springer, (2007)The Price of Resiliency: A Case Study on Sorting with Memory Faults., , и . ESA, том 4168 из Lecture Notes in Computer Science, стр. 768-779. Springer, (2006)Dynamically Switching Vertices in Planar Graphs (Extended Abstract)., и . ESA, том 1284 из Lecture Notes in Computer Science, стр. 186-199. Springer, (1997)