callback( { "result":{ "query":":facetid:toc:\"db/journals/mst/mst41.bht\"", "status":{ "@code":"200", "text":"OK" }, "time":{ "@unit":"msecs", "text":"64.72" }, "completions":{ "@total":"1", "@computed":"1", "@sent":"1", "c":{ "@sc":"38", "@dc":"38", "@oc":"38", "@id":"43475610", "text":":facetid:toc:db/journals/mst/mst41.bht" } }, "hits":{ "@total":"38", "@computed":"38", "@sent":"38", "@first":"0", "hit":[{ "@score":"1", "@id":"5488706", "info":{"authors":{"author":{"@pid":"64/3320","text":"Faisal N. Abu-Khzam"}},"title":"Pseudo-Kernelization: A Branch-then-Reduce Approach for FPT Problems.","venue":"Theory Comput. Syst.","volume":"41","number":"3","pages":"399-410","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/Abu-Khzam07","doi":"10.1007/S00224-007-1344-0","ee":"https://doi.org/10.1007/s00224-007-1344-0","url":"https://dblp.org/rec/journals/mst/Abu-Khzam07"}, "url":"URL#5488706" }, { "@score":"1", "@id":"5488707", "info":{"authors":{"author":[{"@pid":"64/3320","text":"Faisal N. Abu-Khzam"},{"@pid":"f/MichaelRFellows","text":"Michael R. Fellows"},{"@pid":"l/MALangston","text":"Michael A. Langston"},{"@pid":"44/1932","text":"W. Henry Suters"}]},"title":"Crown Structures for Vertex Cover Kernelization.","venue":"Theory Comput. Syst.","volume":"41","number":"3","pages":"411-430","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/Abu-KhzamFLS07","doi":"10.1007/S00224-007-1328-0","ee":"https://doi.org/10.1007/s00224-007-1328-0","url":"https://dblp.org/rec/journals/mst/Abu-KhzamFLS07"}, "url":"URL#5488707" }, { "@score":"1", "@id":"5488710", "info":{"authors":{"author":[{"@pid":"b/JanABergstra","text":"Jan A. Bergstra"},{"@pid":"m/KeesMiddelburg","text":"Cornelis A. Middelburg"}]},"title":"A Thread Algebra with Multi-Level Strategic Interleaving.","venue":"Theory Comput. Syst.","volume":"41","number":"1","pages":"3-32","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/BergstraM07","doi":"10.1007/S00224-006-1337-4","ee":"https://doi.org/10.1007/s00224-006-1337-4","url":"https://dblp.org/rec/journals/mst/BergstraM07"}, "url":"URL#5488710" }, { "@score":"1", "@id":"5488713", "info":{"authors":{"author":[{"@pid":"29/2559","text":"Hans-Joachim Böckenhauer"},{"@pid":"h/JurajHromkovic","text":"Juraj Hromkovic"},{"@pid":"39/6043","text":"Joachim Kneis"},{"@pid":"k/JoachimKupke2","text":"Joachim Kupke 0002"}]},"title":"The Parameterized Approximability of TSP with Deadlines.","venue":"Theory Comput. Syst.","volume":"41","number":"3","pages":"431-444","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/BockenhauerHKK07","doi":"10.1007/S00224-007-1347-X","ee":"https://doi.org/10.1007/s00224-007-1347-x","url":"https://dblp.org/rec/journals/mst/BockenhauerHKK07"}, "url":"URL#5488713" }, { "@score":"1", "@id":"5488714", "info":{"authors":{"author":[{"@pid":"62/548","text":"Elmar Böhler"},{"@pid":"39/3349","text":"Henning Schnoor"}]},"title":"The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates.","venue":"Theory Comput. Syst.","volume":"41","number":"4","pages":"753-777","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/BohlerS07","doi":"10.1007/S00224-006-1301-3","ee":"https://doi.org/10.1007/s00224-006-1301-3","url":"https://dblp.org/rec/journals/mst/BohlerS07"}, "url":"URL#5488714" }, { "@score":"1", "@id":"5488715", "info":{"authors":{"author":{"@pid":"42/6655","text":"Michael Brinkmeier"}},"title":"A Simple and Fast Min-Cut Algorithm.","venue":"Theory Comput. Syst.","volume":"41","number":"2","pages":"369-380","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/Brinkmeier07","doi":"10.1007/S00224-007-2010-2","ee":"https://doi.org/10.1007/s00224-007-2010-2","url":"https://dblp.org/rec/journals/mst/Brinkmeier07"}, "url":"URL#5488715" }, { "@score":"1", "@id":"5488718", "info":{"authors":{"author":[{"@pid":"b/JonathanFBuss","text":"Jonathan F. Buss"},{"@pid":"57/2573","text":"Tarique Islam"}]},"title":"Algorithms in the W-Hierarchy.","venue":"Theory Comput. Syst.","volume":"41","number":"3","pages":"445-457","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/BussI07","doi":"10.1007/S00224-007-1325-3","ee":"https://doi.org/10.1007/s00224-007-1325-3","url":"https://dblp.org/rec/journals/mst/BussI07"}, "url":"URL#5488718" }, { "@score":"1", "@id":"5488719", "info":{"authors":{"author":[{"@pid":"c/LimingCai","text":"Liming Cai"},{"@pid":"f/MichaelRFellows","text":"Michael R. Fellows"},{"@pid":"j/DavidWJuedes","text":"David W. Juedes"},{"@pid":"34/783","text":"Frances A. Rosamond"}]},"title":"The Complexity of Polynomial-Time Approximation.","venue":"Theory Comput. Syst.","volume":"41","number":"3","pages":"459-477","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/CaiFJR07","doi":"10.1007/S00224-007-1346-Y","ee":"https://doi.org/10.1007/s00224-007-1346-y","url":"https://dblp.org/rec/journals/mst/CaiFJR07"}, "url":"URL#5488719" }, { "@score":"1", "@id":"5488720", "info":{"authors":{"author":[{"@pid":"71/6744","text":"F. Cedo"},{"@pid":"71/4169","text":"Ana Cortés"},{"@pid":"27/2915","text":"Ana Ripoll"},{"@pid":"18/836","text":"Miquel A. Senar"},{"@pid":"92/4942","text":"Emilio Luque"}]},"title":"The Convergence of Realistic Distributed Load-Balancing Algorithms.","venue":"Theory Comput. Syst.","volume":"41","number":"4","pages":"609-618","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/CedoCRSL07","doi":"10.1007/S00224-006-1214-1","ee":"https://doi.org/10.1007/s00224-006-1214-1","url":"https://dblp.org/rec/journals/mst/CedoCRSL07"}, "url":"URL#5488720" }, { "@score":"1", "@id":"5488721", "info":{"authors":{"author":{"@pid":"35/1866","text":"Pieter Collins"}},"title":"Optimal Semicomputable Approximations to Reachable and Invariant Sets.","venue":"Theory Comput. Syst.","volume":"41","number":"1","pages":"33-48","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/Collins07","doi":"10.1007/S00224-006-1338-3","ee":"https://doi.org/10.1007/s00224-006-1338-3","url":"https://dblp.org/rec/journals/mst/Collins07"}, "url":"URL#5488721" }, { "@score":"1", "@id":"5488722", "info":{"authors":{"author":[{"@pid":"06/5313","text":"S. Barry Cooper"},{"@pid":"47/6904","text":"Benedikt Löwe"},{"@pid":"43/5920","text":"Peter van Emde Boas"}]},"title":"Theory of Computation at CiE 2005.","venue":"Theory Comput. Syst.","volume":"41","number":"1","pages":"1-2","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/CooperLB07","doi":"10.1007/S00224-006-4101-X","ee":"https://doi.org/10.1007/s00224-006-4101-x","url":"https://dblp.org/rec/journals/mst/CooperLB07"}, "url":"URL#5488722" }, { "@score":"1", "@id":"5488723", "info":{"authors":{"author":[{"@pid":"d/FKHADehne","text":"Frank K. H. A. Dehne"},{"@pid":"f/MichaelRFellows","text":"Michael R. Fellows"},{"@pid":"l/MALangston","text":"Michael A. Langston"},{"@pid":"34/783","text":"Frances A. Rosamond"},{"@pid":"97/5577","text":"Kim Stevens"}]},"title":"An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem.","venue":"Theory Comput. Syst.","volume":"41","number":"3","pages":"479-492","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/DehneFLRS07","doi":"10.1007/S00224-007-1345-Z","ee":"https://doi.org/10.1007/s00224-007-1345-z","url":"https://dblp.org/rec/journals/mst/DehneFLRS07"}, "url":"URL#5488723" }, { "@score":"1", "@id":"5488726", "info":{"authors":{"author":{"@pid":"d/RodneyGDowney","text":"Rod Downey"}},"title":"Foreword.","venue":"Theory Comput. Syst.","volume":"41","number":"3","pages":"397","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/DowneyE07","doi":"10.1007/S00224-007-4006-3","ee":"https://doi.org/10.1007/s00224-007-4006-3","url":"https://dblp.org/rec/journals/mst/DowneyE07"}, "url":"URL#5488726" }, { "@score":"1", "@id":"5488728", "info":{"authors":{"author":[{"@pid":"19/6404","text":"Michael Elkin"},{"@pid":"p/DavidPeleg","text":"David Peleg"}]},"title":"The Hardness of Approximating Spanner Problems.","venue":"Theory Comput. Syst.","volume":"41","number":"4","pages":"691-729","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/ElkinP07","doi":"10.1007/S00224-006-1266-2","ee":"https://doi.org/10.1007/s00224-006-1266-2","url":"https://dblp.org/rec/journals/mst/ElkinP07"}, "url":"URL#5488728" }, { "@score":"1", "@id":"5488729", "info":{"authors":{"author":{"@pid":"64/2682","text":"Amin Farjudian"}},"title":"Shrad: A Language for Sequential Real Number Computation.","venue":"Theory Comput. Syst.","volume":"41","number":"1","pages":"49-105","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/Farjudian07","doi":"10.1007/S00224-006-1339-2","ee":"https://doi.org/10.1007/s00224-006-1339-2","url":"https://dblp.org/rec/journals/mst/Farjudian07"}, "url":"URL#5488729" }, { "@score":"1", "@id":"5488730", "info":{"authors":{"author":[{"@pid":"f/FedorVFomin","text":"Fedor V. Fomin"},{"@pid":"96/4012","text":"Pinar Heggernes"},{"@pid":"k/DieterKratsch","text":"Dieter Kratsch"}]},"title":"Exact Algorithms for Graph Homomorphisms.","venue":"Theory Comput. Syst.","volume":"41","number":"2","pages":"381-393","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/FominHK07","doi":"10.1007/S00224-007-2007-X","ee":"https://doi.org/10.1007/s00224-007-2007-x","url":"https://dblp.org/rec/journals/mst/FominHK07"}, "url":"URL#5488730" }, { "@score":"1", "@id":"5488732", "info":{"authors":{"author":[{"@pid":"51/251","text":"Bernhard Fuchs"},{"@pid":"51/1778","text":"Walter Kern"},{"@pid":"26/4743","text":"Daniel Mölle"},{"@pid":"01/322-1","text":"Stefan Richter 0001"},{"@pid":"r/PeterRossmanith","text":"Peter Rossmanith"},{"@pid":"57/5893","text":"Xinhui Wang"}]},"title":"Dynamic Programming for Minimum Steiner Trees.","venue":"Theory Comput. Syst.","volume":"41","number":"3","pages":"493-500","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/FuchsKMRRW07","doi":"10.1007/S00224-007-1324-4","ee":"https://doi.org/10.1007/s00224-007-1324-4","url":"https://dblp.org/rec/journals/mst/FuchsKMRRW07"}, "url":"URL#5488732" }, { "@score":"1", "@id":"5488733", "info":{"authors":{"author":[{"@pid":"18/4703","text":"Li Gao"},{"@pid":"31/1185","text":"Grzegorz Malewicz"}]},"title":"Toward Maximizing the Quality of Results of Dependent Tasks Computed Unreliably.","venue":"Theory Comput. Syst.","volume":"41","number":"4","pages":"731-752","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/GaoM07","doi":"10.1007/S00224-006-1296-9","ee":"https://doi.org/10.1007/s00224-006-1296-9","url":"https://dblp.org/rec/journals/mst/GaoM07"}, "url":"URL#5488733" }, { "@score":"1", "@id":"5488735", "info":{"authors":{"author":[{"@pid":"g/JiongGuo","text":"Jiong Guo"},{"@pid":"n/RolfNiedermeier","text":"Rolf Niedermeier"},{"@pid":"75/5664-1","text":"Sebastian Wernicke 0001"}]},"title":"Parameterized Complexity of Vertex Cover Variants.","venue":"Theory Comput. Syst.","volume":"41","number":"3","pages":"501-520","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/GuoNW07","doi":"10.1007/S00224-007-1309-3","ee":"https://doi.org/10.1007/s00224-007-1309-3","url":"https://dblp.org/rec/journals/mst/GuoNW07"}, "url":"URL#5488735" }, { "@score":"1", "@id":"5488736", "info":{"authors":{"author":[{"@pid":"74/2412","text":"Gregory Z. Gutin"},{"@pid":"53/2428","text":"Arash Rafiey"},{"@pid":"s/StefanSzeider","text":"Stefan Szeider"},{"@pid":"47/4121","text":"Anders Yeo"}]},"title":"The Linear Arrangement Problem Parameterized Above Guaranteed Value.","venue":"Theory Comput. Syst.","volume":"41","number":"3","pages":"521-538","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/GutinRSY07","doi":"10.1007/S00224-007-1330-6","ee":"https://doi.org/10.1007/s00224-007-1330-6","url":"https://dblp.org/rec/journals/mst/GutinRSY07"}, "url":"URL#5488736" }, { "@score":"1", "@id":"5488738", "info":{"authors":{"author":[{"@pid":"h/MichaelTHallett","text":"Michael T. Hallett"},{"@pid":"42/1539","text":"Catherine McCartin"}]},"title":"A Faster FPT Algorithm for the Maximum Agreement Forest Problem.","venue":"Theory Comput. Syst.","volume":"41","number":"3","pages":"539-550","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/HallettM07","doi":"10.1007/S00224-007-1329-Z","ee":"https://doi.org/10.1007/s00224-007-1329-z","url":"https://dblp.org/rec/journals/mst/HallettM07"}, "url":"URL#5488738" }, { "@score":"1", "@id":"5488739", "info":{"authors":{"author":{"@pid":"53/1317","text":"Petr Hlinený"}},"title":"Some Hard Problems on Matroid Spikes.","venue":"Theory Comput. Syst.","volume":"41","number":"3","pages":"551-562","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/Hlineny07","doi":"10.1007/S00224-007-1307-5","ee":"https://doi.org/10.1007/s00224-007-1307-5","url":"https://dblp.org/rec/journals/mst/Hlineny07"}, "url":"URL#5488739" }, { "@score":"1", "@id":"5488742", "info":{"authors":{"author":[{"@pid":"74/441","text":"Tomasz Jurdzinski"},{"@pid":"56/6707","text":"Krzysztof Lorys"}]},"title":"Leftist Grammars and the Chomsky Hierarchy.","venue":"Theory Comput. Syst.","volume":"41","number":"2","pages":"233-256","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/JurdzinskiL07","doi":"10.1007/S00224-007-2017-8","ee":"https://doi.org/10.1007/s00224-007-2017-8","url":"https://dblp.org/rec/journals/mst/JurdzinskiL07"}, "url":"URL#5488742" }, { "@score":"1", "@id":"5488744", "info":{"authors":{"author":[{"@pid":"44/4813","text":"Sanjiv Kapoor"},{"@pid":"42/2793","text":"Mohammad Sarwat"}]},"title":"Bounded-Diameter Minimum-Cost Graph Problems.","venue":"Theory Comput. Syst.","volume":"41","number":"4","pages":"779-794","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/KapoorS07","doi":"10.1007/S00224-006-1305-Z","ee":"https://doi.org/10.1007/s00224-006-1305-z","url":"https://dblp.org/rec/journals/mst/KapoorS07"}, "url":"URL#5488744" }, { "@score":"1", "@id":"5488749", "info":{"authors":{"author":{"@pid":"51/4645","text":"Matthias P. Krieger"}},"title":"On the Incompressibility of Monotone DNFs.","venue":"Theory Comput. Syst.","volume":"41","number":"2","pages":"211-231","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/Krieger07","doi":"10.1007/S00224-007-2013-Z","ee":"https://doi.org/10.1007/s00224-007-2013-z","url":"https://dblp.org/rec/journals/mst/Krieger07"}, "url":"URL#5488749" }, { "@score":"1", "@id":"5488751", "info":{"authors":{"author":[{"@pid":"06/5685","text":"Maciej Liskiewicz"},{"@pid":"r/RReischuk","text":"Rüdiger Reischuk"}]},"title":"Preface.","venue":"Theory Comput. Syst.","volume":"41","number":"2","pages":"209-210","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/LiskiewiczR07","doi":"10.1007/S00224-007-4003-6","ee":"https://doi.org/10.1007/s00224-007-4003-6","url":"https://dblp.org/rec/journals/mst/LiskiewiczR07"}, "url":"URL#5488751" }, { "@score":"1", "@id":"5488754", "info":{"authors":{"author":{"@pid":"m/KlausMeer","text":"Klaus Meer"}},"title":"Some Relations between Approximation Problems and PCPs over the Real Numbers.","venue":"Theory Comput. Syst.","volume":"41","number":"1","pages":"107-118","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/Meer07","doi":"10.1007/S00224-006-1336-5","ee":"https://doi.org/10.1007/s00224-006-1336-5","url":"https://dblp.org/rec/journals/mst/Meer07"}, "url":"URL#5488754" }, { "@score":"1", "@id":"5488755", "info":{"authors":{"author":{"@pid":"27/3300-1","text":"Daniel Meister 0001"}},"title":"Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers.","venue":"Theory Comput. Syst.","volume":"41","number":"2","pages":"257-289","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/Meister07","doi":"10.1007/S00224-007-2034-7","ee":"https://doi.org/10.1007/s00224-007-2034-7","url":"https://dblp.org/rec/journals/mst/Meister07"}, "url":"URL#5488755" }, { "@score":"1", "@id":"5488756", "info":{"authors":{"author":{"@pid":"m/PBMiltersen","text":"Peter Bro Miltersen"}},"title":"The Computational Complexity of One-Dimensional Sandpiles.","venue":"Theory Comput. Syst.","volume":"41","number":"1","pages":"119-125","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/Miltersen07","doi":"10.1007/S00224-006-1341-8","ee":"https://doi.org/10.1007/s00224-006-1341-8","url":"https://dblp.org/rec/journals/mst/Miltersen07"}, "url":"URL#5488756" }, { "@score":"1", "@id":"5488757", "info":{"authors":{"author":{"@pid":"76/2272","text":"Milad Niqui"}},"title":"Productivity of Edalat-Potts Exact Arithmetic in Constructive Type Theory.","venue":"Theory Comput. Syst.","volume":"41","number":"1","pages":"127-154","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/Niqui07","doi":"10.1007/S00224-006-1342-7","ee":"https://doi.org/10.1007/s00224-006-1342-7","url":"https://dblp.org/rec/journals/mst/Niqui07"}, "url":"URL#5488757" }, { "@score":"1", "@id":"5488759", "info":{"authors":{"author":[{"@pid":"25/2134","text":"Venkatesh Raman 0001"},{"@pid":"11/5491","text":"Saket Saurabh 0001"},{"@pid":"70/1506","text":"Somnath Sikdar"}]},"title":"Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques.","venue":"Theory Comput. Syst.","volume":"41","number":"3","pages":"563-587","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/RamanSS07","doi":"10.1007/S00224-007-1334-2","ee":"https://doi.org/10.1007/s00224-007-1334-2","url":"https://dblp.org/rec/journals/mst/RamanSS07"}, "url":"URL#5488759" }, { "@score":"1", "@id":"5488760", "info":{"authors":{"author":{"@pid":"74/5752","text":"Kunihiko Sadakane"}},"title":"Compressed Suffix Trees with Full Functionality.","venue":"Theory Comput. Syst.","volume":"41","number":"4","pages":"589-607","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/Sadakane07","doi":"10.1007/S00224-006-1198-X","ee":"https://doi.org/10.1007/s00224-006-1198-x","url":"https://dblp.org/rec/journals/mst/Sadakane07"}, "url":"URL#5488760" }, { "@score":"1", "@id":"5488761", "info":{"authors":{"author":{"@pid":"62/4215","text":"Birgit Schelm"}},"title":"Average-Case Non-Approximability of Optimisation Problems.","venue":"Theory Comput. Syst.","volume":"41","number":"2","pages":"351-368","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/Schelm07","doi":"10.1007/S00224-007-2012-0","ee":"https://doi.org/10.1007/s00224-007-2012-0","url":"https://dblp.org/rec/journals/mst/Schelm07"}, "url":"URL#5488761" }, { "@score":"1", "@id":"5488763", "info":{"authors":{"author":[{"@pid":"73/1491","text":"Holger Spakowski"},{"@pid":"67/6112","text":"Rahul Tripathi"}]},"title":"On the Power of Unambiguity in Alternating Machines.","venue":"Theory Comput. Syst.","volume":"41","number":"2","pages":"291-326","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/SpakowskiT07","doi":"10.1007/S00224-007-2014-Y","ee":"https://doi.org/10.1007/s00224-007-2014-y","url":"https://dblp.org/rec/journals/mst/SpakowskiT07"}, "url":"URL#5488763" }, { "@score":"1", "@id":"5488764", "info":{"authors":{"author":{"@pid":"41/1415","text":"Till Tantau"}},"title":"Logspace Optimization Problems and Their Approximability Properties.","venue":"Theory Comput. Syst.","volume":"41","number":"2","pages":"327-350","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/Tantau07","doi":"10.1007/S00224-007-2011-1","ee":"https://doi.org/10.1007/s00224-007-2011-1","url":"https://dblp.org/rec/journals/mst/Tantau07"}, "url":"URL#5488764" }, { "@score":"1", "@id":"5488766", "info":{"authors":{"author":{"@pid":"v/JanisVoigtlander","text":"Janis Voigtländer"}},"title":"Formal Efficiency Analysis for Tree Transducer Composition.","venue":"Theory Comput. Syst.","volume":"41","number":"4","pages":"619-689","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/Voigtlander07","doi":"10.1007/S00224-006-1235-9","ee":"https://doi.org/10.1007/s00224-006-1235-9","url":"https://dblp.org/rec/journals/mst/Voigtlander07"}, "url":"URL#5488766" }, { "@score":"1", "@id":"5488769", "info":{"authors":{"author":{"@pid":"z/NingZhong2","text":"Ning Zhong 0002"}},"title":"Computable Analysis of a Boundary-Value Problem for the Korteweg-de Vries Equation.","venue":"Theory Comput. Syst.","volume":"41","number":"1","pages":"155-175","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/Zhong07","doi":"10.1007/S00224-006-1335-6","ee":"https://doi.org/10.1007/s00224-006-1335-6","url":"https://dblp.org/rec/journals/mst/Zhong07"}, "url":"URL#5488769" }, { "@score":"1", "@id":"5488770", "info":{"authors":{"author":{"@pid":"z/MartinZiegler1","text":"Martin Ziegler 0001"}},"title":"Real Hypercomputation and Continuity.","venue":"Theory Comput. Syst.","volume":"41","number":"1","pages":"177-206","year":"2007","type":"Journal Articles","access":"closed","key":"journals/mst/Ziegler07","doi":"10.1007/S00224-006-1343-6","ee":"https://doi.org/10.1007/s00224-006-1343-6","url":"https://dblp.org/rec/journals/mst/Ziegler07"}, "url":"URL#5488770" } ] } } } )