Characterizing TC0 in Terms of Infinite Groups Andreas KrebsKlaus-Jorn LangeStephanie Reifferscheid OriginalPaper Pages: 303 - 325
Sorting Stably, in Place, with O(n log n) Comparisons and O(n) Moves Gianni Franceschini OriginalPaper Pages: 327 - 353
Robust Polynomials and Quantum Algorithms Harry BuhrmanIlan NewmanRonald de Wolf OriginalPaper Pages: 379 - 395
Cellular Automata: Real-Time Equivalence between One-Dimensional Neighborhoods Victor Poupet OriginalPaper Pages: 409 - 421
Truthful Approximation Mechanisms for Scheduling Selfish Related Machines Nir AndelmanYossi AzarMotti Sorani OriginalPaper Pages: 423 - 436
The Variable Hierarchy of the μ-Calculus Is Strict Dietmar BerwangerErich GradelGiacomo Lenzi OriginalPaper Pages: 437 - 466
Algorithms to Compute Minimum Cycle Basis in Directed Graphs Telikepalli KavithaKurt Mehlhorn OriginalPaper Pages: 485 - 505
Computing Minimal Multi-Homogeneous Bezout Numbers Is Hard Gregorio MalajovichKlaus Meer OriginalPaper Pages: 553 - 570