@article{Flocchini-Pelc-Santoro/09,
AUTHOR = {Flocchini, Paola and Pelc, Andrzej and Santoro, Nicola},
TITLE = {Fault-tolerant sequential scan},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {1},
PAGES = {1-26},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/6k8n51852445142g/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Kral/09,
AUTHOR = {Kr{\'a}l', Daniel},
TITLE = {Polynomial-size binary decision diagrams for the exactly half-$d$-hyperclique problem reading each input bit twice},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {1},
PAGES = {27-42},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/00l2334x09753l20/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Chiola-Cordasco-Gargano-Hammar-Negro-al/09,
AUTHOR = {Chiola, Giovanni and Cordasco, Gennaro and Gargano, Luisa and Hammar, Mikael and Negro, Alberto and al., et},
TITLE = {Degree-optimal routing for P2P systems},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {1},
PAGES = {43-63},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/k03616l037019l64/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Dai/09a,
AUTHOR = {Dai, Jack Jie},
TITLE = {An outer-measure approach for resource-bounded measure},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {1},
PAGES = {64-73},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/y46183667h15m806/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Jurdzinski/09,
AUTHOR = {Jurdzi{\'n}ski, Tomasz},
TITLE = {Probabilistic length-reducing two-pushdown automata},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {1},
PAGES = {74-107},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/r43886778720w225/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Cai-Choudhary-Lu/09,
AUTHOR = {Cai, Jin-Yi and Choudhary, Vinay and Lu, Pinyan},
TITLE = {On the theory of matchgate computations},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {1},
PAGES = {108-132},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/96w1612847450375/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Forys-Oprocha/09,
AUTHOR = {Fory{\'s}, Wit and Oprocha, Piotr},
TITLE = {Infinite traces and symbolic dynamics},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {1},
PAGES = {133-149},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/0l7p4v89746875j2/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Antunes-Fortnow/09,
AUTHOR = {Antunes, Lu{\'{i}}s and Fortnow, Lance},
TITLE = {Sophistication revisited},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {1},
PAGES = {150-161},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/q132605835826g76/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Tsaggouris-Zaroliagis/09,
AUTHOR = {Tsaggouris, George and Zaroliagis, Christos},
TITLE = {Multiobjective optimization: Improved FPTAS for shortest paths and non-linear objectives with applications},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {1},
PAGES = {162-186},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/u8k6231801816888/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Le_Gall/09a,
AUTHOR = {Le Gall, Fran{\c{c}}ois},
TITLE = {Exponential separation of quantum and classical online space complexity},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {2},
PAGES = {188-202},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/g8p2q758m4m6v03m/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Frigo-Strumpen/09,
AUTHOR = {Frigo, Matteo and Strumpen, Volker},
TITLE = {The cache complexity of multithreaded cache oblivious algorithms},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {2},
PAGES = {203-233},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/l8946u2p54m72263/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Awerbuch-Scheideler/09a,
AUTHOR = {Awerbuch, Baruch and Scheideler, Christian},
TITLE = {Towards a scalable and robust DHT},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {2},
PAGES = {234-260},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/68154q3474746175/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Alon-Awerbuch-Azar-Patt-Shamir/09,
AUTHOR = {Alon, Noga and Awerbuch, Baruch and Azar, Yossi and Patt-Shamir, Boaz},
TITLE = {Tell me who I am: An interactive recommendation system},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {2},
PAGES = {261-279},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/dp711222r258w114/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Godfrey-Karp/09,
AUTHOR = {Godfrey, P. Brighten and Karp, Richard M.},
TITLE = {On the price of heterogeneity in parallel systems},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {2},
PAGES = {280-301},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/b587371x30n53km5/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Chen-Roughgarden/09,
AUTHOR = {Chen, Ho-Lin and Roughgarden, Tim},
TITLE = {Network design with weighted players},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {2},
PAGES = {302-324},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/t662217w11221463/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Litman-Moran-Schein/09,
AUTHOR = {Litman, Ami and Moran-Schein, Shiri},
TITLE = {Smooth scheduling under variable rates or the analog-digital confinement game},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {2},
PAGES = {325-354},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/u4631l50200t10t2/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Iliopoulos-Rahman/09a,
AUTHOR = {Iliopoulos, Costas S. and Rahman, M. Sohel},
TITLE = {A new efficient algorithm for computing the longest common subsequence},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {2},
PAGES = {355-371},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/637288131367v42r/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Lipets/09,
AUTHOR = {Lipets, Vladimir},
TITLE = {Bounds on mincut for Cayley graphs over Abelian Groups},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {2},
PAGES = {372-380},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/4484026767462055/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Blanchet-Sadri-Brownstein-Kalcic-Palumbo-Weynand/09,
AUTHOR = {Blanchet-Sadri, F. and Brownstein, N.C. and Kalcic, Andy and Palumbo, Justin and Weynand, T.},
TITLE = {Unavoidable sets of partial words},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {2},
PAGES = {381-406},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/95863212lm164k16/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Hsieh-Weng/09,
AUTHOR = {Hsieh, Sun-Yuan and Weng, Yu-Fen},
TITLE = {Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {2},
PAGES = {407-425},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/a6477x5239828221/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Erlebach-Kaklamanis/09,
AUTHOR = {Erlebach, Thomas and Kaklamanis, Christos},
TITLE = {WAOA 2006 special issue of TOCS},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {3},
PAGES = {427-428},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/5673801l5m1q18t3/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Bar-Noy-Golin-Zhang/09,
AUTHOR = {Bar-Noy, Amotz and Golin, Mordecai J. and Zhang, Yan},
TITLE = {Online dynamic programming speedups},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {3},
PAGES = {429-445},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/343g245826203275/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{de_Berg-Cabello-Har-Peled/09,
AUTHOR = {de Berg, Mark and Cabello and Har-Peled, Sariel},
TITLE = {Covering many or few points with unit disks},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {3},
PAGES = {446-469},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/4083857400756173/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Bonifaci-Stougie/09,
AUTHOR = {Bonifaci, Vincenzo and Stougie, Leen},
TITLE = {Online $k$-server routing problems},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {3},
PAGES = {470-485},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/b357427141634281/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Chan-Zarrabi-Zadeh/09,
AUTHOR = {Chan, Timothy M. and Zarrabi-Zadeh, Hamid},
TITLE = {A randomized algorithm for online unit clustering},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {3},
PAGES = {486-496},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/k2336205u1666521/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Das-Kenyon-Mathieu/09,
AUTHOR = {Das, Aparna and Kenyon-Mathieu, Claire},
TITLE = {On hierarchical diameter-clustering and the supplier problem},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {3},
PAGES = {497-511},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/n0111171164xn078/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Fukunaga-Nagamochi/09,
AUTHOR = {Fukunaga, Takuro and Nagamochi, Hiroshi},
TITLE = {Network design with edge-connectivity and degree constraints},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {3},
PAGES = {512-532},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/x13401k40v281438/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Harks-Heinz-Pfetsch/09,
AUTHOR = {Harks, Tobias and Heinz, Stefan and Pfetsch, Marc E.},
TITLE = {Competitive online multicommodity routing},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {3},
PAGES = {533-554},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/9034xlrt7p12236v/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Athanassopoulos-Caragiannis-Kaklamanis/09,
AUTHOR = {Athanassopoulos, Stavros and Caragiannis, Ioannis and Kaklamanis, Christos},
TITLE = {Analysis of approximation algorithms for $k$-set cover using factor-revealing linear programs},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {3},
PAGES = {555-576},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/x71038qg262u7m47/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Fenner-Gasarch-Postow/09,
AUTHOR = {Fenner, Stephen and Gasarch, William and Postow, Brian},
TITLE = {The complexity of finding SUBSEQ(A)},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {3},
PAGES = {577-612},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/d7j477317887h738/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Dorn/09,
AUTHOR = {D{\"o}rn, Sebastian},
TITLE = {Quantum algorithms for matching problems},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {3},
PAGES = {613-628},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/e380j7310635331w/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Friedl-Ivanyos-Santha-Verhoeven/09,
AUTHOR = {Friedl, Katalin and Ivanyos, G{\'a}bor and Santha, Miklos and Verhoeven, Yves F.},
TITLE = {On the black-box complexity of Sperner's lemma},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {3},
PAGES = {629-646},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/9323n4334151878g/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Cooper-Mayordomo-Sorbi/09,
AUTHOR = {Cooper, S. Barry and Mayordomo, Elvira and Sorbi, Andrea},
TITLE = {Computation and logic in the real world: CiE 2007},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {4},
PAGES = {647-649},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/k9264346j367m1g0/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Adriaans/09,
AUTHOR = {Adriaans, Pieter},
TITLE = {Between order and chaos: The quest for meaningful information},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {4},
PAGES = {650-674},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/635k27p66632646g/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Allender-Barrington-Chakraborty-Datta-Roy/09,
AUTHOR = {Allender, Eric and Barrington, David A. Mix and Chakraborty, Tanmoy and Datta, Samir and Roy, Sambuddha},
TITLE = {Planar and grid graph reachability problems},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {4},
PAGES = {675-723},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/d1004776t3k34m6v/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Antunes-Matos-Souto-Vitani/09,
AUTHOR = {Antunes, Lu{\'{i}}s and Matos, Armando and Souto, Andr{\'e} and Vit{\'a}ni, Paul},
TITLE = {Depth as randomness deficiency},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {4},
PAGES = {724-739},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/m1536k2u256kr7u8/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Bienvenu-Doty-Stephan/09,
AUTHOR = {Bienvenu, Laurent and Doty, David and Stephan, Frank},
TITLE = {Constructive dimension and Turing degrees},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {4},
PAGES = {740-755},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/47753v04u6811483/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Case-Moelius/09a,
AUTHOR = {Case, John and Moelius, Samuel E.},
TITLE = {Characterizing programming systems allowing program self-reference},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {4},
PAGES = {756-772},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/033p213548270347/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Case/09,
AUTHOR = {Case, John},
TITLE = {Resource restricted computability theoretic learning: Illustrative topics and problems},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {4},
PAGES = {773-786},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/812361171q2264pu/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Danner-Royer/09,
AUTHOR = {Danner, Norman and Royer, James S.},
TITLE = {Two algorithms in search of a type-system},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {4},
PAGES = {787-821},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/qv44p1x725kv0016/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Fellows-Lokshtanov-Misra-Mnich-Rosamond-Saurabh/09,
AUTHOR = {Fellows, Michael and Lokshtanov, Daniel and Misra, Neeldhara and Mnich, Matthias and Rosamond, Frances and Saurabh, Saket},
TITLE = {The complexity ecology of parameters: An illustration using bounded max leaf number},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {4},
PAGES = {822-848},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/454354683520r672/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Jain-Martin-Stephan/09,
AUTHOR = {Jain, Sanjay and Martin, Eric and Stephan, Frank},
TITLE = {Input-dependence in function-learning},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {4},
PAGES = {849-864},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/t448g2083421512j/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Koucky/09,
AUTHOR = {Kouck{\'y}, Michal},
TITLE = {Circuit complexity of regular languages},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {4},
PAGES = {865-879},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/e0v48v48g777q60g/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Li/09e,
AUTHOR = {Li, Chung-Chih},
TITLE = {Speed-up theorems in type-2 computations using oracle Turing machines},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {4},
PAGES = {880-896},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/e2281l62r6p37420/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Melnikov/09,
AUTHOR = {Melnikov, Alexander G.},
TITLE = {Enumerations and completely decomposable torsion-free Abelian groups},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {4},
PAGES = {897-916},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/657516j51u051257/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Olsen/09,
AUTHOR = {Olsen, Martin},
TITLE = {Nash stability in additively separable hedonic games and community structures},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {4},
PAGES = {917-925},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/l3h3780m363x06l8/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Onsjo-Watanabe/09,
AUTHOR = {Onsj{\"o}, Mikael and Watanabe, Osamu},
TITLE = {Theory of computing systems (TOCS) submission version finding most likely solutions},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {4},
PAGES = {926-942},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/u46304p12276580l/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory; see Erratum in Theory of Computing Systems, Vol. 45, 2010, No. 4, 943-943},
}
@article{Onsjo-Watanabe/09a,
AUTHOR = {Onsj{\"o}, Mikael and Watanabe, Osamu},
TITLE = {Erratum to ``Finding most likely solutions''},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {4},
PAGES = {943-943},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/g0p6n24768010846/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory; Originally in Theory of Computing Systems, Vol. 45, 2010, No. 4, 926-942},
}
@article{Pinto/09,
AUTHOR = {Pinto, Alexandre},
TITLE = {Comparing notions of computational entropy},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {4},
PAGES = {944-962},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/6670005864380070/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Santo/09,
AUTHOR = {Santo, Jos{\'e} Esp{\'{i}}rito},
TITLE = {The $\lambda$-calculus and the unity of structural proof theory},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {4},
PAGES = {963-994},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/e2037271k3401xj3/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Wiedermann-Petru/09,
AUTHOR = {Wiedermann, Ji{\v{r}}{\'{i}} and Petr{\.u}, Luk{\'a}{\v{s}}},
TITLE = {On the universal computing power of amorphous computing systems},
JOURNAL = {Theory of Computing Systems},
VOLUME = {45},
NUMBER = {4},
PAGES = {995-1010},
YEAR = {2009},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/k2x6266k78274m05/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}