431 | -- | 449 | Leah Epstein, Arik Ganot. Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation |
450 | -- | 464 | Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli. Synthesis of Autosymmetric Functions in a New Three-Level Form |
465 | -- | 487 | Micah Adler, Ying Gong, Arnold L. Rosenberg. On Exploiting Node-Heterogeneous Clusters Optimally |
488 | -- | 518 | Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek. On the Complexity of 2-Monotone Restarting Automata |
519 | -- | 535 | Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci. Store-and-Forward Multicast Routing on the Mesh |
536 | -- | 567 | Blaise Genest, Anca Muscholl. Pattern Matching and Membership for Hierarchical Message Sequence Charts |
568 | -- | 595 | José L. Balcázar, Yang Dai, Junichi Tanaka, Osamu Watanabe. Provably Fast Training Algorithms for Support Vector Machines |
596 | -- | 607 | Aduri Pavan, N. V. Vinodchandran. Relations between Average-Case and Worst-Case Complexity |
608 | -- | 631 | Manfred Droste, Paul Gastin. On Aperiodic and Star-Free Formal Power Series in Partially Commuting Variables |
632 | -- | 650 | Michele Flammini, Luca Moscardelli, Alfredo Navarra, Stephane Perennes. Asymptotically Optimal Solutions for Small World Graphs |