Lecture Notes in Computer Science 3884Commenced Publication in 1973Founding and Former Series Editors:Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen

Editorial Board

David HutchisonLancaster University, UK

Takeo KanadeCarnegie Mellon University, Pittsburgh, PA, USA

Josef KittlerUniversity of Surrey, Guildford, UK

Jon M. KleinbergCornell University, Ithaca, NY, USA

Friedemann MatternETH Zurich, Switzerland

John C. MitchellStanford University, CA, USA

Moni NaorWeizmann Institute of Science, Rehovot, Israel

Oscar NierstraszUniversity of Bern, Switzerland

C. Pandu RanganIndian Institute of Technology, Madras, India

Bernhard SteffenUniversity of Dortmund, Germany

Madhu SudanMassachusetts Institute of Technology, MA, USA

Demetri TerzopoulosNew York University, NY, USA

Doug TygarUniversity of California, Berkeley, CA, USA

Moshe Y. VardiRice University, Houston, TX, USA

Gerhard WeikumMax-Planck Institute of Computer Science, Saarbruecken, Germany

Bruno Durand Wolfgang Thomas (Eds.)

STACS 2006

23rd Annual Symposiumon Theoretical Aspects of Computer ScienceMarseille, France, February 23-25, 2006Proceedings

1 3

Volume Editors

Bruno DurandLaboratoire d’Informatique Fondamentale de Marseille CMI39 rue Joliot-Curie, 13453 Marseille Cedex 13, FranceE-mail: bruno.durand@lif.univ-mrs.fr

Wolfgang ThomasRWTH AachenLehrstuhl Informatik VII52056 Aachen, GermanyE-mail: thomas@informatik.rwth-aachen.de

Library of Congress Control Number: 2006920575

CR Subject Classification (1998): F, E.1, I.3.5, G.2

LNCS Sublibrary: SL 1 – Theoretical Computer Science and General Issues

ISSN 0302-9743ISBN-10 3-540-32301-5 Springer Berlin Heidelberg New YorkISBN-13 978-3-540-32301-3 Springer Berlin Heidelberg New York

This work is subject to copyright. All rights are reserved, whether the whole or part of the material isconcerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting,reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publicationor parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965,in its current version, and permission for use must always be obtained from Springer. Violations are liableto prosecution under the German Copyright Law.

Springer is a part of Springer Science+Business Media

springer.com

© Springer-Verlag Berlin Heidelberg 2006Printed in Germany

Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, IndiaPrinted on acid-free paper SPIN: 11672142 06/3142 5 4 3 2 1 0

Preface

The Symposium on Theoretical Aspects of Computer Science (STACS) is alter-nately held in France and in Germany. The conference of February 23–25, 2006,held at Marseille was the 23rd in this series. Previous meetings took place inParis (1984), Saarbrucken (1985), Orsay (1986), Passau (1987), Bordeaux (1988),Paderborn (1989), Rouen (1990), Hamburg (1991), Cachan (1992), Wurzburg(1993), Caen (1994), Munchen (1995), Grenoble (1996), Lubeck (1997), Paris(1998), Trier (1999), Lille (2000), Dresden (2001), Antibes (2002), Berlin (2003),Montpellier (2004) and Stuttgart (2005).

The interest in STACS has been increasing continuously during recent years –and even strongly this year. The STACS 2006 call for papers led to 283 submis-sions from all over the world. We had a two-day physical meeting for the ProgramCommittee in Paris in November 2006 where all members of the Program Com-mittee were present. We would like to thank the Program Committee and allexternal referees for the valuable work they put into the reviewing process. Eachsubmission was assigned to at least 3 Programme Committee members, henceeach member was in charge of about 50 papers. Only 54 papers (i.e., 19 % ofthe submissions) could be accepted, as we wanted to keep the conference in itsstandard format with only two parallel sessions.

We would like to thank the three invited speakers, Philippe Flajolet, LeonidLevin and Helmut Seidl, for their contributions to the proceedings.

Special thanks are due to Andrei Voronkov for his EasyChair software(www.easychair.org) and for his continuous support in runnning it. This soft-ware was used for the process of paper selection and also for preparing thecamera-ready copy of this proceedings volume.

December 2005 Bruno Durand and Wolfgang Thomas

Conference Organization

Bruno Durand

Laboratoire d’Informatique Fondamentale de Marseille

Program Chairs

Bruno Durand, Wolfgang Thomas

Program Committee

Mark de BergJulian BradfieldBruno DurandChristoph DurrFedor V. FominMarkus LohreyFilippo MignosiMadhavan MukundSeffi NaorRolf NiedermeierJean-Eric PinPeter SandersLuc SegoufinAlexander ShenWolfgang ThomasJacobo ToranAlexander Zvonkin

Local Organization

Gregory LafitteRemi MorinNicolas Ollinger, chairLiva Ralaivola. . .

VIII Organization

External Reviewers

Karen AardalAshkan AazamiFarid AblayevBharat AdsulManindra AgrawalDorit AharonovSusanne AlbersGabriele AlessandraEric AllenderJean-Paul AlloucheNoga AlonErnst AlthausAndris AmbainisKlaus Ambos-SpiesMarcella AnselmoV. ArvindEugene AsarinDavid AspinallDaniel AugotYossi AzarFranz BaaderMaxim BabenkoChristine BachocChristel BaierFabien BailleEuripide BampisNikhil BansalAmotz Bar-NoyReuven Bar-YehudaZiv Bar-YossefVince BaranyJeremy BarbayDavid M. BarringtonAnjoy BaruahShai Ben-DavidMichael A. BenderMarc BenkertLasse BergrothJulien BernetJean BerstelValrie BertheLaurent BienvenueMarkus Blaser

Stephen BlochLuc BoassonManuel BodirskyHans L. BodlaenderFabrice BazzaroNicolas BonichonPaola BonizzoniAndreas BrandstadtSabine BrodaAndrej BrodnikAnne Bruggemann-KleinNiv BuchbinderHarry BuhrmanAndrei BulatovMartin W. BunderMarie-Pierre BealGruia CalinescuOlivier CartonJulien CassaigneJorge CastroBogdan CautisSupratik ChakrabortyTimothy ChanSerge ChaumetteChandra ChekuriJoseph CheriyanHubie ChenJana ChlebikovaChristian ChoffrutMarek ChrobakAmin Coja-OghlanRichard ColeAnne CondonThierry CoquandChris CoulstonBruno CourcellePierluigi CrescenziM. CrochemoreMary CryanJanos CsirikFelipe CuckerArtur CzumajEdson Norberto Caceres

Organization IX

Peter DamaschkeSilvano Dal ZilioSamir DattaXavier DefagoCarole DelporteRoman DementievStephane DemriFrancois DenisLuc DevroyVolker DiekertMichael DomFrederic DornGilles DowekDevdatt DubhashiPhilippe DuchonChristian DuncanJacques DuparcDeepak D’SouzaRan El-YanivEdith ElkindRoee EngelbergJoost EngelfrietChiara EpifanioThomas ErlebachKousha EtessamiGuy EvenFrancois FagesHugues FauconnierLene FavrholdTomas FederSandor FeketeCristina FernandesHenning FernauPascal FerraroJirı FialaGabriele FiciEldar FischerNathan FisherRudolf FleischerPaola FlocchiniEnrico FormentiHerve FournierPierre FraignaudRusins FreivaldsChristiane Frougny

Stanley P. Y. FungAlessandra GabrielePeter GacsAnna GalJie GaoLeszek GasieniecPaul GastinJoachim von zur GathenRicard GavaldaCyril GavoilleStephen GilmoreHugo GimbertBernhard GittenbergerChristian GlasserLeslie GoldbergMark K. GoldbergAlexander GolynskiGeorg GottlobJens GrammMarkus GrasslFrederik GreenMichelangelo GrigniDimitri GrigorievMartin GroheErich GradelJoachim GudmundssonJiong GuoGregory GutinMichel HabibEran HalperinNicolas HanusseSariel Har-PeledRamesh HariharanTero HarjuHerman HaverkortPatrick HaydenMichiel HazewinkelPinar HeggernesHarald HempelMiki HermannAndre HernichUlrich HertrampfEdward HirschPetr HlinenyThanh Minh Hoang

X Organization

Markus HolzerFalk HuffnerPaul HunterDavid IlcincasLucian IlieNicole ImmorlicaSandy IraniRobert IrvingDmitry ItsyksonAbraham IttaiKazuo IwamaKamal JainMarkus JakobssonJesper JanssonWojciech JaworEmmanuel JeandelMark JerrumJan JohannsenPeter JonssonAntoine JougletMarcin JurdzinskiFrank KammerIyad KanjBruce KapronJuhani KarhumakiJuha KarkkainenClaire KenyonAlex KesselmanSanjeev KhannaAlexander KhodyrevBakhadyr KhoussainovDaniel KirstenAlexey KitaevNils KlarlundRalf KlasingHartmut KlauckChristian KnauerJoachim KneisJohannes KoblerStavros KolliopoulosPetr KolmanAmos KormanDarek KowalskiEvangelos KranakisDieter Kratsch

Matthias KrauseSvetlana KravchenkoMarc van KreveldAndrei KrokhinSven O. KrumkePiotr KrystaAntonin KuceraGregory KucherovManfred KufleitnerFabian KuhnK. Narayan KumarOrna KupfermanDietrich KuskeGregory LafitteKlaus-Jorn LangeMartin LangeSophie LaplanteTroy LeeFrancois LemieuxAsaf LevinLiane Lewin-EytanYury LifshitsWolfgang LindnerAndrzej LingasMaciej LiskiewiczKamal LodayaChristof LodingSylvain LombardyJohn LongleyAntoni LozanoAldo de LucaJack LutzAlejandro MaassAlexis MacielP. MadhusudanFrederic MagniezMeena MahajanMohammad MahdianJean MairesseYury MakarychevKonstantin MakarychevJanos MakowskySebastian ManethYishay MansourSabrina Mantaci

Organization XI

Sciortino MarinellaEric MartinMaarten MarxDaniel MarxDomagoj MatijevicMarios MavronicolasElvira MayordomoRichard MayrJacques MazoyerKlaus MeerWolfgang MerkleJean-Francois MestreAntoine MeyerAdam MeyersonIlya MezhirovMehdi MhallaLoizos MichaelDimitris MichailChristian MichauxPeter Bro MiltersenAlexandre MiquelJoseph MitchellPetr MitrichevShuichi MiyazakiFabien de MontgolfierF. MorainRemi MorinMohamed MosbahPhilippe MoserAnca MuschollHaiko MullerJorn Muller-QuadePavel NalivaikoN.S. NarayanaswamyAshwin NayakJaroslav NesetrilJesper Buus NielsenBengt NilssonDirk NowotkaZeev NutovRyan O’DonnellErnst-Rudiger OlderogMichel OlivierNicolas OllingerRen van Oostrum

Friedrich OttoVincent PadovaniIgor PakParitosh PandyaChristos PapadimitrouChristophe PapazianDavid PelegGiuseppe Della PennaMartin PergelDominique PerrinHolger PetersenGregorio Hernndez PealverJean-Eric PinVal PinciuPavithra PrabhakarKirk PruhsArtem PyatkinArnaud PecherSandra QuickertBalaji RaghavachariLiva RalaivolaVenkatesh RamanR. RamanujamDana RandallC. Pandu RanganIvan RapaportMichael RaskinAndre RaspaudJulian RathkeDror RawitzAlexander RazborovIgor RazgonOded RegevKlaus ReinhardtRudiger ReischukJean-Pierre RessayreAntonio RestivoYossi RichterMike RobsonClaas RoeverAndrei RomashchenkoDana RonAdi RosenPeter RossmanithDaniel Molle

XII Organization

Peter RossmanithMichel de RougemontSasha RubinAndrei RumyantsevJan RuttenMohammad R. SalavatipourPeter SandersMiklos SanthaNicola SantoroMartin SauerhoffSaket SaurabhGabriel ScalosubNicolas SchabanelChristian ScheidelerMarkus SchmidtManfred Schmidt-SchaussHenning SchnoorNicole SchweikardtStefan SchwoonUwe SchoningCarlos SearaLuc SegoufinSebastian SeibertHelmut SeidlArunava SenGeraud SenizerguesAnil SethPeter SewellJiri SgallHadas ShachnaiNatasha ShakhlevichPriti ShankarAbhi ShelatDavid ShermaDetlef SielingSudeshna SinhaJozef SiranRene SittersMartin SkutellaAleksandrs SlivkinsShakhar SmorodinskyBill SmythSagi SnirAlexander SobolChristian Sohler

Samia SouissiFrancis SourdBettina SpeckmannDaniel SpielmanAndreas SpillnerAravind SrinivasanRob van SteeAlexey StepanovFrank StephanIain StewartColin StirlingLeen StougieHoward StraubingGeorg StruthK. V. SubrahmanyamC. R. SubramanianS. P. SureshMaxim SviridenkoChaitanya SwamyStefan SzeiderAmnon Ta-ShamaTami TamirTill TantauGerard TelKavitha TelikepalliAlain TerluttePascal TessonP. S. ThiagarajanAurlie C. ThieleThomas ThieraufDimitrios M. ThilikosTorsten TholeyRick ThomasAshish TiwariLaura TomaLeen TorenvlietHelene TouzetFalk UngerDominique UnruhMaxim UshakovPatchrawat UthaisombutSiavash VahdatiKasturi VaradarajanYann VaxsSantosh Vempala

Organization XIII

Nikolai VereshchaginVictor VianuN. V. VinodchandranMahesh ViswanathanBerthold VockingJorg VogelHeribert VollmerMagnus WallstromIgor WalukiewiczJohn WatrousKarsten WeihePascal Weil

Sebastian WernickeSusanne WetzelThomas WilkeGerhard WoegingerRonald de WolfAlexander WolffStefan WohrleSheng YuMariette YvinecMarc ZeitounAlex ZelikovskyWieslaw Zielonka

Table of Contents

The Ubiquitous Digital TreePhilippe Flajolet . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1

Flat Holonomies on Automata NetworksGene Itkis, Leonid A. Levin . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23

Interprocedurally Analyzing Polynomial IdentitiesMarkus Muller-Olm, Michael Petter, Helmut Seidl . . . . . . . . . . . . . . . . . 50

External String Sorting: Faster and Cache-ObliviousRolf Fagerberg, Anna Pagh, Rasmus Pagh . . . . . . . . . . . . . . . . . . . . . . . . . 68

Amortized Rigidness in Dynamic Cartesian TreesIwona Bialynicka-Birula, Roberto Grossi . . . . . . . . . . . . . . . . . . . . . . . . . . 80

Distribution-Sensitive Construction of Minimum-Redundancy PrefixCodes

Ahmed Belal, Amr Elmasry . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92

On Critical Exponents in Fixed Points of Binary k-Uniform MorphismsDalia Krieger . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 104

Equivalence of F-Algebras and Cubic FormsManindra Agrawal, Nitin Saxena . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 115

Complete Codes in a Sofic ShiftMarie-Pierre Beal, Dominique Perrin . . . . . . . . . . . . . . . . . . . . . . . . . . . . 127

Kolmogorov Complexity with ErrorLance Fortnow, Troy Lee, Nikolai Vereshchagin . . . . . . . . . . . . . . . . . . . . 137

Kolmogorov Complexity and the Recursion TheoremBjørn Kjos-Hanssen, Wolfgang Merkle, Frank Stephan . . . . . . . . . . . . . . 149

Entanglement in Interactive Proof Systems with Binary AnswersStephanie Wehner . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 162

Quantum Algorithms for Matching and Network FlowsAndris Ambainis, Robert Spalek . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 172

XVI Table of Contents

The Number of Runs in a String: Improved Analysis of the LinearUpper Bound

Wojciech Rytter . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 184

Estimating Entropy and Entropy Norm on Data StreamsAmit Chakrabarti, Khanh Do Ba, S. Muthukrishnan . . . . . . . . . . . . . . . . 196

Pay Today for a Rainy Day: Improved Approximation Algorithms forDemand-Robust Min-Cut and Shortest Path Problems

Daniel Golovin, Vineet Goyal, R. Ravi . . . . . . . . . . . . . . . . . . . . . . . . . . . 206

Exact Price of Anarchy for Polynomial Congestion GamesSebastian Aland, Dominic Dumrauf, Martin Gairing,Burkhard Monien, Florian Schoppmann . . . . . . . . . . . . . . . . . . . . . . . . . . 218

Oblivious Symmetric AlternationVenkatesan T. Chakaravarthy, Sambuddha Roy . . . . . . . . . . . . . . . . . . . . 230

Combining Multiple HeuristicsTzur Sayag, Shai Fine, Yishay Mansour . . . . . . . . . . . . . . . . . . . . . . . . . . 242

Conflict-Free Colorings of Rectangles RangesKhaled Elbassioni, Nabil H. Mustafa . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 254

Grid Vertex-Unfolding Orthogonal PolyhedraMirela Damian, Robin Flatland, Joseph O’Rourke . . . . . . . . . . . . . . . . . . 264

Theory and Application of Width Bounded Geometric SeparatorBin Fu . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 277

Invariants of Automatic Presentations and Semi-synchronousTransductions

Vince Barany . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 289

On the Accepting Power of 2-Tape Buchi AutomataOlivier Finkel . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 301

Weighted Picture Automata and Weighted LogicsIna Maurer . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 313

Markov Decision Processes with Multiple ObjectivesKrishnendu Chatterjee, Rupak Majumdar,Thomas A. Henzinger . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 325

Table of Contents XVII

The Algorithmic Structure of Group Strategyproof Budget-BalancedCost-Sharing Mechanisms

Paolo Penna, Carmine Ventre . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 337

Convergence and Approximation in Potential GamesGeorge Christodoulou, Vahab S. Mirrokni,Anastasios Sidiropoulos . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 349

Fast FPT-Algorithms for Cleaning GridsJosep Dıaz, Dimitrios M. Thilikos . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 361

Tradeoffs in Depth-Two SuperconcentratorsChinmoy Dutta, Jaikumar Radhakrishnan . . . . . . . . . . . . . . . . . . . . . . . . . 372

On Hypergraph and Graph Isomorphism with Bounded Color ClassesV. Arvind, Johannes Kobler . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 384

Forbidden Substrings, Kolmogorov Complexity and Almost PeriodicSequences

A.Yu. Rumyantsev, M.A. Ushakov . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 396

Online Learning and Resource-Bounded Dimension: Winnow YieldsNew Lower Bounds for Hard Sets

John M. Hitchcock . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 408

Regularity Problems for Visibly Pushdown LanguagesVince Barany, Christof Loding, Olivier Serre . . . . . . . . . . . . . . . . . . . . . . 420

Regular Expressions and NFAs Without ε-TransitionsGeorg Schnitger . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 432

Redundancy in Complete SetsChristian Glaßer, A. Pavan, Alan L. Selman,Liyu Zhang . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 444

Sparse Selfreducible Sets and Polynomial Size Circuit Lower BoundsHarry Buhrman, Leen Torenvliet, Falk Unger . . . . . . . . . . . . . . . . . . . . . . 455

Linear Advice for Randomized Logarithmic SpaceLance Fortnow, Adam R. Klivans . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 469

Nested Pebbles and Transitive ClosureJoost Engelfriet, Hendrik Jan Hoogeboom . . . . . . . . . . . . . . . . . . . . . . . . . 477

XVIII Table of Contents

Definability of Languages by Generalized First-Order Formulas over(N,+)

Amitabha Roy, Howard Straubing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 489

Generalized Modal SatisfiabilityMichael Bauland, Edith Hemaspaandra, Henning Schnoor,Ilka Schnoor . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 500

Strategy Improvement and Randomized Subexponential Algorithms forStochastic Parity Games

Krishnendu Chatterjee, Thomas A. Henzinger . . . . . . . . . . . . . . . . . . . . . 512

DAG-Width and Parity GamesDietmar Berwanger, Anuj Dawar, Paul Hunter,Stephan Kreutzer . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 524

Reliable Computations Based on Locally Decodable CodesAndrei Romashchenko . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 537

Convergence of Autonomous Mobile Robots with Inaccurate Sensorsand Movements

Reuven Cohen, David Peleg . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 549

A Faster Algorithm for the Steiner Tree ProblemDaniel Molle, Stefan Richter, Peter Rossmanith . . . . . . . . . . . . . . . . . . . 561

Generating Randomized Roundings with Cardinality Constraints andDerandomizations

Benjamin Doerr . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 571

Online Sorting Buffers on LineRohit Khandekar, Vinayaka Pandit . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 584

Optimal Node RoutingYossi Azar, Yoel Chaiutin . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 596

Memoryless Facility Location in One PassDimitris Fotakis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 608

Energy-Efficient Algorithms for Flow Time MinimizationSusanne Albers, Hiroshi Fujiwara . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 621

Efficient Qualitative Analysis of Classes of Recursive Markov DecisionProcesses and Simple Stochastic Games

Kousha Etessami, Mihalis Yannakakis . . . . . . . . . . . . . . . . . . . . . . . . . . . . 634

Table of Contents XIX

Datalog and Constraint Satisfaction with Infinite TemplatesManuel Bodirsky, Vıctor Dalmau . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 646

Evaluating Monotone Circuits on Cylinders, Planes and ToriNutan Limaye, Meena Mahajan, Jayalal Sarma M.N. . . . . . . . . . . . . . . . 660

Constant-Depth Circuits for Arithmetic in Finite Fields ofCharacteristic Two

Alexander Healy, Emanuele Viola . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 672

Weighted Asynchronous Cellular AutomataDietrich Kuske . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 684

On the Complexity of the “Most General” Firing Squad SynchronizationProblem

Darin Goldstein, Kojiro Kobayashi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 696

Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 713