Volume 411,
Number 1,
January 2010
- Dorit S. Hochbaum, Asaf Levin:
Covering the edges of bipartite graphs using K2, 2 graphs.
1-9
- Laurent Lyaudet:
NP-hard and linear variants of hypergraph partitioning.
10-21
- Kohtaro Tadaki, Tomoyuki Yamakami, Jack C. H. Lin:
Theory of one-tape linear-time Turing machines.
22-43
- Leah Epstein, Rob van Stee:
Maximizing the minimum load for selfish agents.
44-57
- Achour Mostéfaoui, Michel Raynal, Corentin Travers:
Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound.
58-69
- Aldo de Luca, Luca Q. Zamboni:
On graphs of central episturmian words.
70-90
- Gem Stapleton, John Howse, Peter J. Rodgers:
A graph theoretic approach to general Euler diagram drawing.
91-112
- Markus Müller:
Stationary algorithmic probability.
113-130
- Marek Chrobak, Jiri Sgall:
Three results on frequency assignment in linear cellular networks.
131-137
- Martin Anthony, Joel Ratsaby:
Maximal width learning of binary functions.
138-147
- Donatella Merlini, Renzo Sprugnoli:
The relevant prefixes of coloured Motzkin walks: An average case analysis.
148-163
- Hartwig Bosse, Jaroslaw Byrka, Evangelos Markakis:
New algorithms for approximate Nash equilibria in bimatrix games.
164-173
- Xiang-Yang Li, Zheng Sun, Weizhao Wang, Xiaowen Chu, ShaoJie Tang, Ping Xu:
Mechanism design for set cover games with selfish element agents.
174-187
- Ulrich Laube, Markus E. Nebel:
Maximum likelihood analysis of algorithms and data structures.
188-212
- Paolo D'Arco, Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
Variations on a theme by Akl and Taylor: Security and tradeoffs.
213-227
- Yun Liu:
Compositions of maximal codes.
228-238
- Allan Borodin, Joan Boyar, Kim S. Larsen, Nazanin Mirmohammadi:
Priority algorithms for graph optimization problems.
239-258
- David Richeson, Paul Winkler, Jim Wiseman:
Itineraries of rigid rotations and diffeomorphisms of the circle.
259-265
- Véronique Terrier:
Simulation of one-way cellular automata by boolean circuits.
266-276
- Mingen Lin, Yang Yang, Jinhui Xu:
On Lazy Bin Covering and Packing problems.
277-284
Notes
Volume 411,
Number 2,
January 2010
Contributions
- Ken Kaneiwa, Ken Satoh:
On the complexities of consistency checking for restricted UML class diagrams.
301-323
- Ken-etsu Fujita:
CPS-translation as adjoint.
324-340
- Stephen L. Bloom, Zoltán Ésik:
A Mezei-Wright theorem for categorical algebras.
341-359
- Lan Lin, Stacy J. Prowell, Jesse H. Poore:
An axiom system for sequence-based specification.
360-376
- Ugo Dal Lago, Andrea Masini, Margherita Zorzi:
Quantum implicit computational complexity.
377-409
- Michele Pagani, Lorenzo Tortora de Falco:
Strong normalization property for second order linear logic.
410-444
- Manuel Bodirsky, Hubie Chen:
Peek arc consistency.
445-453
- Laura Bozzelli, Ruggero Lanotte:
Complexity and succinctness issues for linear-time hybrid logics.
454-469
- Patrick Baillot, Damiano Mazza:
Linear logic by levels and bounded time complexity.
470-503
- María Alpuente, Santiago Escobar, Bernhard Gramlich, Salvador Lucas:
On-demand strategy annotations revisited: An improved on-demand evaluation strategy.
504-541
- Alessandro Romanel, Corrado Priami:
On the computational power of BlenX.
542-565
- Robert M. Hierons:
Canonical finite state machines for distributed systems.
566-580
Volume 411,
Number 3,
January 2010
Contributions
- Oscar H. Ibarra, Juhani Karhumäki, Alexander Okhotin:
On stateless multihead automata: Hierarchies and the emptiness problem.
581-593
- Thi Ha Duong Phan, Tran Thi Thu Huong:
On the stability of Sand Piles Model.
594-601
- Bart Kastermans, Steffen Lempp:
Comparing notions of randomness.
602-616
- Elena Czeizler, Lila Kari, Shinnosuke Seki:
On a special class of primitive words.
617-630
- Christian Mathissen:
Definable transductions and weighted logics for texts.
631-659
- Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli:
When ignorance helps: Graphical multicast cost sharing games.
660-671
- Wanyong Tian, Minming Li, Enhong Chen:
Energy optimal schedules for jobs with multiple active intervals.
672-676
Notes
Volume 411,
Numbers 4-5,
January 2010
Preface
Contributions
- Henrik Björklund, Thomas Schwentick:
On notions of regularity for data languages.
702-715
- Gaëlle Brevier, Romeo Rizzi, Stéphane Vialette:
Complexity issues in color-preserving graph embeddings.
716-729
- Robert Brijder, Miika Langille, Ion Petre:
Extended strings and graphs for simple gene assembly.
730-738
- Jin-yi Cai, Pinyan Lu:
On blockwise symmetric signatures for matchgates.
739-750
- Thomas Colcombet:
Factorization forests for infinite words and applications to countable scattered linear orderings.
751-764
- Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop:
Productivity of stream definitions.
765-782
- Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe:
On the complexity of kings.
783-798
- Michael Hoffmann, Richard M. Thomas:
Notions of hyperbolicity in monoids.
799-811
- Martin Kutrib, Andreas Malcher:
Real-time reversible iterative arrays.
812-822
- Andrea Sattler-Klein:
Some complexity results for prefix Gröbner bases in free monoid rings.
823-833
Copyright © Fri Mar 12 17:33:15 2010
by Michael Ley (ley@uni-trier.de)
