@article{Englert-Franke-Olbrich/10,
AUTHOR = {Englert, Matthias and Franke, Thomas and Olbrich, Lars},
TITLE = {Sensitivity of Wardrop equilibria},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {1},
PAGES = {3-14},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/t241vq1280761h64/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Buchbinder-Lewin-Eytan-Naor-Orda/10,
AUTHOR = {Buchbinder, Niv and Lewin-Eytan, Liane and Naor, Joseph (Seffi) and Orda, Ariel},
TITLE = {Non-cooperative cost sharing games via subsidies},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {1},
PAGES = {15-37},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/r110722187160820/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Fotakis-Kaporis-Spirakis/10,
AUTHOR = {Fotakis, D. and Kaporis, A.C. and Spirakis, P.G.},
TITLE = {Atomic congestion games: Fast, myopic and concurrent},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {1},
PAGES = {38-59},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/h2036j5116007051/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Feldmann-Mavronicolas-Pieris/10,
AUTHOR = {Feldmann, Rainer and Mavronicolas, Marios and Pieris, Andreas},
TITLE = {Facets of the fully mixed Nash equilibrium conjecture},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {1},
PAGES = {60-112},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/f0x6573v4n581702/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Fotakis/10,
AUTHOR = {Fotakis, Dimitris},
TITLE = {Congestion games with linearly independent paths: Convergence time and price of anarchy},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {1},
PAGES = {113-136},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/a620134478822151/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Edmonds-Datta-Dymond/10,
AUTHOR = {Edmonds, Jeff and Datta, Suprakash and Dymond, Patrick},
TITLE = {TCP is competitive with resource augmentation},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {1},
PAGES = {137-161},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/m42n06713047417q/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Beyersdorff/10,
AUTHOR = {Beyersdorff, Olaf},
TITLE = {The deduction theorem for strong propositional proof systems},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {1},
PAGES = {162-178},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/w288422x7h517851/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Blanchet-Sadri-Clader-Simpson/10,
AUTHOR = {Blanchet-Sadri, F. and Clader, E. and Simpson, O.},
TITLE = {Border correlations of partial words},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {1},
PAGES = {179-195},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/864n215m2v1862r6/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Huffner-Komusiewicz-Moser-Niedermeier/10,
AUTHOR = {H{\"u}ffner, Falk and Komusiewicz, Christian and Moser, Hannes and Niedermeier, Rolf},
TITLE = {Fixed-parameter algorithms for cluster vertex deletion},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {1},
PAGES = {196-217},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/x26245u4r2687324/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Fotakis/10a,
AUTHOR = {Fotakis, Dimitris},
TITLE = {Stackelberg strategies for atomic congestion games},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {1},
PAGES = {218-249},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/c21x82017737t097/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Kharlampovich-Lvsenok-Mvasnikov-Touikan/10,
AUTHOR = {Kharlampovich, O. and Lvs{\"e}nok, I.G. and Mvasnikov, A.G. and Touikan, N.W.M.},
TITLE = {The solvability problem for quadratic equations over free groups is $NP$-complete},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {1},
PAGES = {250-258},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/d5t7644233277455/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Rapin_Parvedy-Raynal-Travers/10,
AUTHOR = {Ra{\"{\i}}pin Parv{\'e}dy, Philippe and Raynal, M. and Travers, C.},
TITLE = {Strongly terminating early-stopping $k$-set agreement in synchronous systems with general omission failures},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {1},
PAGES = {259-287},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/p076405m6u864661/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Toran/10,
AUTHOR = {Tor{\'a}n, Jacobo},
TITLE = {Reductions to graph isomorphism},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {1},
PAGES = {288-299},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/e700m75q37r88458/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Loos-Ogihara/10,
AUTHOR = {Loos, Remco and Ogihara, Mitsunori},
TITLE = {Time and space complexity for splicing systems},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {2},
PAGES = {301-316},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/8j5q8q2261752013/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Buhrman-Hescott-Homer-Torenvliet/10,
AUTHOR = {Buhrman, Harry and Hescott, Benjamin and Homer, Steven and Torenvliet, Leen},
TITLE = {Non-uniform reductions},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {2},
PAGES = {317-341},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/r7366606101x4v8k/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Chang-Lin-Rossmanith/10,
AUTHOR = {Chang, Maw-Shang and Lin, Chuang-Chieh and Rossmanith, Peter},
TITLE = {New fixed-parameter algorithms for the minimum quartet inconsistency problem},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {2},
PAGES = {342-367},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/w46575r28676tp8w/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Derbel-Mosbah-Zemmari/10,
AUTHOR = {Derbel, Bilel and Mosbah, Mohamed and Zemmari, Akka},
TITLE = {Sublinear fully distributed partition with applications},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {2},
PAGES = {368-404},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/13985412514353k5/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Gairing-Lucking-Mavronicolas-Monien/10,
AUTHOR = {Gairing, Martin and L{\"u}cking, Thomas and Mavronicolas, Marios and Monien, Burkhard},
TITLE = {Computing Nash equilibria for scheduling on restricted parallel links},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {2},
PAGES = {405-432},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/q7n8267q76716v55/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Leone-Nikoletseas-Rolim/10,
AUTHOR = {Leone, Pierre and Nikoletseas, Sotiris and Rolim, Jose{\'e}},
TITLE = {Stochastic models and adaptive algorithms for energy balance in sensor networks},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {2},
PAGES = {433-453},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/62k3r55591406869/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Bauland-Bohler-Creignou-Reith-Schnoor-Vollmer/10,
AUTHOR = {Bauland, Michael and B{\"o}hler, Elmar and Creignou, Nadia and Reith, Steffen and Schnoor, Henning and Vollmer, Heribert},
TITLE = {The complexity of problems for quantified constraints},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {2},
PAGES = {454-490},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/727w711566856102/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Galesi-Lauria/10,
AUTHOR = {Galesi, Nicola and Lauria, Massimo},
TITLE = {On the automatizability of polynomial calculus},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {2},
PAGES = {491-506},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/n7j6757lq3773nr7/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Bilo-Fanelli-Flammini-Melideo-Moscardelli/10,
AUTHOR = {Bil{\`o}, Vittorio and Fanelli, Angelo and Flammini, Michele and Melideo, Giovanna and Moscardelli, Luca},
TITLE = {Designing fast converging cost sharing methods for multicast transmissions},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {2},
PAGES = {507-530},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/v42134h6116036hx/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Courcelle-Twigg/10,
AUTHOR = {Courcelle, Bruno and Twigg, Andrew},
TITLE = {Constrained-path labellings on graphs of bounded clique-width},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {2},
PAGES = {531-567},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/b3268gtk313180q0/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Cain-Oliver-Ruskuc-Thomas/10,
AUTHOR = {Cain, Alan J. and Oliver, Graham and Ru{\v{s}}kuc, Nik and Thomas, Richard M.},
TITLE = {Automatic presentations and semigroup constructions},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {2},
PAGES = {568-592},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/p08077t1n3048l78/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Bollig-Range-Wegener/10,
AUTHOR = {Bollig, Beate and Range, Niko and Wegener, Ingo},
TITLE = {Exact OBDD bounds for some fundamental functions},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {2},
PAGES = {593-609},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/75g6763t074p65v7/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Erlebach-Hagerup-Jansen-Minzlaff-Wolff/10,
AUTHOR = {Erlebach, Thomas and Hagerup, Thomas and Jansen, Klaus and Minzlaff, Moritz and Wolff, Alexander},
TITLE = {Trimming of graphs, with application to point labeling},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {3},
PAGES = {613-636},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/wk2087473626j73l/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Bjorklund-Husfeldt-Kaski-Kolvisto/10,
AUTHOR = {Bj{\"o}rklund, Andreas and Husfeldt, Thore and Kaski, Petteri and Kolvisto, Mikko},
TITLE = {Trimmed Moebius inversion and graphs of bounded degree},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {3},
PAGES = {637-654},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/636r1653qj74h154/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Thierauf-Wagner/10,
AUTHOR = {Thierauf, Thomas and Wagner, Fabian},
TITLE = {The isomorphism problem for planar 3-connected graphs is in unambiguous logspace},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {3},
PAGES = {655-673},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/nl512n9674q836h0/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Damian-Flatland-ORourke-Ramaswami/10,
AUTHOR = {Damian, Mirela and Flatland, Robin and O'Rourke, Joseph and Ramaswami, Suneeta},
TITLE = {Connecting polygonizations via stretches and twangs},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {3},
PAGES = {674-695},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/a075353046209211/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Fischer-Gradel-Kaiser/10,
AUTHOR = {Fischer, Diana and Gr{\"a}del, Erich and Kaiser, {\L}ukasz},
TITLE = {Model checking games for the quantitative $\mu$-calculus},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {3},
PAGES = {696-719},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/qj8p74228863m451/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Bienvenu-Muchnik-Shen-Vereshchagin/10,
AUTHOR = {Bienvenu, Laurent and Muchnik, Andrej and Shen, Alexander and Vereshchagin, Nikolay},
TITLE = {Limit complexities revisited},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {3},
PAGES = {720-736},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/5124171314345772/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Datta-Kulkarni-Roy/10,
AUTHOR = {Datta, Samir and Kulkarni, Raghav and Roy, Sambuddha},
TITLE = {Deterministically isolating a perfect matching in bipartite planar graphs},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {3},
PAGES = {737-757},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/l8u475pju8765115/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Sakarovitch-de_Souza/10,
AUTHOR = {Sakarovitch, Jacques and de Souza, Rodrigo},
TITLE = {Lexicographic decomposition of $k$-valued transducers},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {3},
PAGES = {758-785},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/d272546223747r65/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Ambainis/10a,
AUTHOR = {Ambainis, Andris},
TITLE = {Quantum search with variable times},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {3},
PAGES = {786-807},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/fk6463347m50355p/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Kuhn-Moscibroda/10,
AUTHOR = {Kuhn, Fabian and Moscibroda, Thomas},
TITLE = {Distributed approximation of capacitated dominating sets},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {4},
PAGES = {811-836},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/75k235471162t040/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Abraham-Gavoille-Malkhi-Wiedr/10,
AUTHOR = {Abraham, Ittai and Gavoille, Cyril and Malkhi, Dahlia and Wiedr, Udi},
TITLE = {Strong-diameter decompositions of minor free graphs},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {4},
PAGES = {837-855},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/67p1p1345278776q/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Lin-Rajaraman/10,
AUTHOR = {Lin, Guolong and Rajaraman, Rajmohan},
TITLE = {Approximation algorithms for multiprocessor scheduling under uncertainty},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {4},
PAGES = {856-877},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/n57842q6021k7848/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Chowdhury-Ramachandran/10,
AUTHOR = {Chowdhury, Rezaul Alam and Ramachandran, Vijaya},
TITLE = {The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and experimental evaluation},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {4},
PAGES = {878-919},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/n23n2x6j3v0v0269/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Fraigniaud-Korman-Lebhar/10,
AUTHOR = {Fraigniaud, Pierre and Korman, Amos and Lebhar, Emmanuelle},
TITLE = {Local MST computation with short advice},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {4},
PAGES = {920-933},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/x53x17627h6u6415/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Bender-Brodal-Fagerberg-Jacob-Vicari/10,
AUTHOR = {Bender, Michael A. and Brodal, Gerth St{\o}lting and Fagerberg, Rolf and Jacob, Riko and Vicari, Elias},
TITLE = {Optimal sparse matrix dense vector multiplication in the I/O-model},
JOURNAL = {Theory of Computing Systems},
VOLUME = {47},
NUMBER = {4},
PAGES = {934-962},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/8116156437880850/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Rybalov/10,
AUTHOR = {Rybalov, Alexander N.},
TITLE = {Generic complexity of Presburger arithmetic},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {1},
PAGES = {2-8},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/q43w11256h440488/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Mahajan-Sarma/10,
AUTHOR = {Mahajan, Meena and Sarma, Jayalal M.N.},
TITLE = {On the complexity of matrix rank and rigidity},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {1},
PAGES = {9-26},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/82147270n6863558/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Jez-Okhotin/10b,
AUTHOR = {Je{\.z}, Artur and Okhotin, Alexander},
TITLE = {Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {1},
PAGES = {27-58},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/62363576l871n237/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Babenko/10a,
AUTHOR = {Babenko, Maxim A.},
TITLE = {A fast algorithm for the path 2-packing problem},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {1},
PAGES = {59-79},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/p2r1671vh5450455/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Glasser-Herr-Reitwiessner-Travers-Waldherr/10,
AUTHOR = {Gla{\ss}er, Christian and Herr, Katrin and Reitwie{\ss}ner, Christian and Travers, Stephen and Waldherr, Matthias},
TITLE = {Equivalence problems for circuits over sets of natural numbers},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {1},
PAGES = {80-103},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/006k2602650k48r0/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Hoffmann-Lifshits-Lifshits-Nowotka/10,
AUTHOR = {Hoffmann, Benjamin and Lifshits, Mikhail and Lifshits, Yury and Nowotka, Dirk},
TITLE = {Maximal intersection queries in randomized input models},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {1},
PAGES = {104-119},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/k84np624219t4473/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Cheng-Tarasov-Vyalyi/10,
AUTHOR = {Cheng, Qi and Tarasov, Sergey P. and Vyalyi, Mikhail N.},
TITLE = {Efficient algorithms for sparse cyclotomic integer zero testing},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {1},
PAGES = {120-142},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/n2q3nh1p265880q0/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Buhrman-Fortnow-Koucky-Rogers-Vershchagin/10,
AUTHOR = {Buhrman, Harry and Fortnow, Lance and Kouck{\'y}, Michal and Rogers, John D. and Vershchagin, Nikolay},
TITLE = {Does the polynomial hierarchy collapse if onto functions are invertible?},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {1},
PAGES = {143-156},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/33112812x68210hu/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Asano-Brass-Sasahara/10,
AUTHOR = {Asano, Tetsuo and Brass, Peter and Sasahara, Shinji},
TITLE = {Disc covering problem with application to digital halftoning},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {2},
PAGES = {157-173},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/gn26080118t44253/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Manea-Margenstern-Mitrana-Perez-Jimenez/10,
AUTHOR = {Manea, Florin and Margenstern, Maurice and Mitrana, Victor and P{\'e}rez-Jim{\'e}nez, Mario J.},
TITLE = {A new characterization of $NP, P$ and $P$SPACE with accepting hybrid networks of evolutionary processors},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {2},
PAGES = {174-192},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/865688637337gu63/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Tripathi/10,
AUTHOR = {Tripathi, Rahul},
TITLE = {The 1-versus-2 queries problem revisited},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {2},
PAGES = {193-221},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/48p51071207q670n/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Faliszewski-Ogihara/10,
AUTHOR = {Faliszewski, Piotr and Ogihara, Mitsunori},
TITLE = {On the autoreducibility of functions},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {2},
PAGES = {222-245},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/93v1732187l51378/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Epstein-Imreh-Levin/10a,
AUTHOR = {Epstein, Leah and Imreh, Csan{\'a}d and Levin, Asaf},
TITLE = {Class constrained bin covering},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {2},
PAGES = {246-260},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/jq33475072u7j374/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Damaschke/10a,
AUTHOR = {Damaschke, Peter},
TITLE = {Fixed-parameter enumerability of cluster editing and related problems},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {2},
PAGES = {261-283},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/2u861nn08024g647/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Caminiti-Fusco-Petreschi/10,
AUTHOR = {Caminiti, Saverio and Fusco, Emanuele G. and Petreschi, Rossella},
TITLE = {Bijective linear time coding and decoding for $k$-trees},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {2},
PAGES = {284-300},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/h5732q1544h6135r/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Jukna/10,
AUTHOR = {Jukna, Stasys},
TITLE = {Entropy of operators or why matrix multiplication is hard for depth-two circuits},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {2},
PAGES = {301-310},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/r048k436r53024v4/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Fellows-Flum-Hermelin-Muller-Rosamond/10,
AUTHOR = {Fellows, Michael and Flum, J{\"o}rg and Hermelin, Danny and M{\"u}ller, Moritz and Rosamond, Frances},
TITLE = {$W$-hierarchies defined by symmetric gates},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {2},
PAGES = {311-339},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/hv5208p25725044t/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Andreev-McNicholl/10,
AUTHOR = {Andreev, Valentin V. and McNicholl, Timothy H.},
TITLE = {Computing interpolating sequences},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {2},
PAGES = {340-350},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/9qwx2n5347381g18/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Choffrut-DAlessandro-Varricchio/10,
AUTHOR = {Choffrut, Christian and D'Alessandro, Flavio and Varricchio, Stefano},
TITLE = {On bounded rational trace languages},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {2},
PAGES = {351-369},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/vm0w56103n740053/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Jonsson-Nordh/10,
AUTHOR = {Jonsson, Peter and Nordh, Gustav},
TITLE = {Approximability of clausal constraints},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {2},
PAGES = {370-395},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/c512214665187h87/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Cai-Lu/10a,
AUTHOR = {Cai, Jin-Yi and Lu, Pinyan},
TITLE = {On symmetric signatures in holographic algorithms},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {3},
PAGES = {398-415},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/58387665pv522279/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Czumaj-Sohler/10,
AUTHOR = {Czumaj, Artur and Sohler, Christian},
TITLE = {Small space representations for metric min-sum $k$-clustering and their applications},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {3},
PAGES = {416-442},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/d33v5674382k5035/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Berstel-Boasson-Carton-Fagnot/10,
AUTHOR = {Berstel, Jean and Boasson, Luc and Carton, Olivier and Fagnot, Isabelle},
TITLE = {Sturmian trees},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {3},
PAGES = {443-478},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/n0006l7150484n7q/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Formenti-Kurka-Zahradnik/10,
AUTHOR = {Formenti, Enrico and K{\r{u}}rka, Petr and Zahradn{\'{i}}k, Ond{\v{r}}ej},
TITLE = {A search algorithm for subshift attractors of cellular automata},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {3},
PAGES = {479-498},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/v4676mm568667673/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Limaye-Mahajan-Rao/10,
AUTHOR = {Limaye, Nutan and Mahajan, Meena and Rao, B.V. Raghavendra},
TITLE = {Arithmetizing classes around NC$^1$ and L},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {3},
PAGES = {499-522},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/549100q3h7835601/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Coja-Oghlan-Krivelevich-Vilenchik/10,
AUTHOR = {Coja-Oghlan, Amin and Krivelevich, Michael and Vilenchik, Dan},
TITLE = {Why almost all $k$-colorable graphs are easy to color},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {3},
PAGES = {523-565},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/a835016861860511/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Bodlaender-van_Dijk/10,
AUTHOR = {Bodlaender, Hans L. and van Dijk, Thomas C.},
TITLE = {A cubic kernel for feedback vertex set and loop cutset},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {3},
PAGES = {566-597},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/n622271208527170/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}
@article{Bienvenu/10,
AUTHOR = {Bienvenu, Laurent},
TITLE = {Kolmogorov-Loveland stochasticity and Kolmogorov complexity},
JOURNAL = {Theory of Computing Systems},
VOLUME = {46},
NUMBER = {3},
PAGES = {598-617},
YEAR = {2010},
EDITOR = {Selman, Alan L.},
URL = {http://springerlink.metapress.com/content/d621808521553p11/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {formerly Mathematical Systems Theory},
}