Your search returned the following 7 documents:

7. Testing Generalised Freeness of Words
   Pawel Gawrychowski, Florin Manea, and Dirk Nowotka
   In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), Lyon, France, 2014, 337-349
   
6. A Descartes algorithm for polynomials with bit-stream coefficients
   Arno Eigenwillig, Lutz Kettner, Werner Krandick, Kurt Mehlhorn, Susanne Schmitt, and Nicola Wolpert
   In: Computer Algebra in Scientific Computing : 8th International Workshop, CASC 2005, Kalamata, Greece, 2005, 138-149
   [PDF: Download: AG1_003.pdf] [PDF: Download: Mehlhorn_a_2005_a.pdf]
   
5. The diamond operator - Implementation of exact real algebraic numbers
   Susanne Schmitt
   In: Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, Kalamata, Greece, 2005, 355-366
   [PS: Download: ext.ps]
   
4. Engineering an External Memory Minimum Spanning Tree Algorithm
   Roman Dementiev, Peter Sanders, Dominik Schultes, and Jop F. Sibeyn
   In: 3rd IFIP International Conference on Theoretical Computer Science (TSC2004), Toulouse, France, 2004, 195-208
   [PDF: Download: emst.pdf]
   
3. On-line and Dynamic Algorithms for Shortest Path Problems
   Hristo N. Djidjev, Grammati E. Pantziou, and Christos Zaroliagis
   In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March, 2nd - 4th, 1995, 193-204
   
2. On the Average Running Time of Odd-Even Merge Sort
   Christine Rüb
   In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March, 2nd - 4th, 1995, 491-501
   
1. Prefix Graphs and their Applications
   Shiva Chaudhuri and Torben Hagerup
   In: Graph-theoretic Concepts in Computer Science: 20th International Workshop (WG94), Hersching, Germany, June, 16th - 18th, 1994, 1995, 206-218