callback( { "result":{ "query":":facetid:toc:\"db/journals/jcss/jcss73.bht\"", "status":{ "@code":"200", "text":"OK" }, "time":{ "@unit":"msecs", "text":"245.62" }, "completions":{ "@total":"1", "@computed":"1", "@sent":"1", "c":{ "@sc":"72", "@dc":"72", "@oc":"72", "@id":"43466927", "text":":facetid:toc:db/journals/jcss/jcss73.bht" } }, "hits":{ "@total":"72", "@computed":"72", "@sent":"72", "@first":"0", "hit":[{ "@score":"1", "@id":"5479687", "info":{"authors":{"author":[{"@pid":"a/FotoNAfrati","text":"Foto N. Afrati"},{"@pid":"l/ChenLi1","text":"Chen Li 0001"},{"@pid":"u/JeffreyDUllman","text":"Jeffrey D. Ullman"}]},"title":"Using views to generate efficient evaluation plans for queries.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"5","pages":"703-724","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/AfratiLU07","doi":"10.1016/J.JCSS.2006.10.019","ee":"https://doi.org/10.1016/j.jcss.2006.10.019","url":"https://dblp.org/rec/journals/jcss/AfratiLU07"}, "url":"URL#5479687" }, { "@score":"1", "@id":"5479688", "info":{"authors":{"author":[{"@pid":"a/RAlur","text":"Rajeev Alur"},{"@pid":"25/5231","text":"Arun Chandrashekharapuram"}]},"title":"Dispatch sequences for embedded control models.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"2","pages":"156-170","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/AlurC07","doi":"10.1016/J.JCSS.2006.04.003","ee":"https://doi.org/10.1016/j.jcss.2006.04.003","url":"https://dblp.org/rec/journals/jcss/AlurC07"}, "url":"URL#5479688" }, { "@score":"1", "@id":"5479689", "info":{"authors":{"author":[{"@pid":"87/4929","text":"Nasser Alzeidi"},{"@pid":"96/4551","text":"Ahmad Khonsari"},{"@pid":"02/3730","text":"Mohamed Ould-Khaoua"},{"@pid":"19/4488","text":"Lewis M. Mackenzie"}]},"title":"A new approach to model virtual channels in interconnection networks.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"8","pages":"1121-1130","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/AlzeidiKOM07","doi":"10.1016/J.JCSS.2007.02.002","ee":"https://doi.org/10.1016/j.jcss.2007.02.002","url":"https://dblp.org/rec/journals/jcss/AlzeidiKOM07"}, "url":"URL#5479689" }, { "@score":"1", "@id":"5479690", "info":{"authors":{"author":[{"@pid":"39/4827","text":"Björn Andersson"},{"@pid":"32/3451","text":"Cecilia Ekelin"}]},"title":"Exact admission-control for integrated aperiodic and periodic tasks.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"2","pages":"225-241","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/AnderssonE07","doi":"10.1016/J.JCSS.2006.04.001","ee":"https://doi.org/10.1016/j.jcss.2006.04.001","url":"https://dblp.org/rec/journals/jcss/AnderssonE07"}, "url":"URL#5479690" }, { "@score":"1", "@id":"5479691", "info":{"authors":{"author":{"@pid":"68/244","text":"Martin Anthony"}},"title":"On the generalization error of fixed combinations of classifiers.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"5","pages":"725-734","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/Anthony07","doi":"10.1016/J.JCSS.2006.10.017","ee":"https://doi.org/10.1016/j.jcss.2006.10.017","url":"https://dblp.org/rec/journals/jcss/Anthony07"}, "url":"URL#5479691" }, { "@score":"1", "@id":"5479692", "info":{"authors":{"author":[{"@pid":"22/6780-1","text":"Krishnakumar Balasubramanian 0001"},{"@pid":"70/4439","text":"Jaiganesh Balasubramanian"},{"@pid":"30/5241","text":"Jeff Parsons"},{"@pid":"83/287","text":"Aniruddha S. Gokhale"},{"@pid":"s/DouglasCSchmidt","text":"Douglas C. Schmidt"}]},"title":"A Platform-Independent Component Modeling Language for Distributed Real-time and Embedded Systems.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"2","pages":"171-185","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/BalasubramanianBPGS07","doi":"10.1016/J.JCSS.2006.04.008","ee":"https://doi.org/10.1016/j.jcss.2006.04.008","url":"https://dblp.org/rec/journals/jcss/BalasubramanianBPGS07"}, "url":"URL#5479692" }, { "@score":"1", "@id":"5479693", "info":{"authors":{"author":[{"@pid":"b/JoseLBalcazar","text":"José L. Balcázar"},{"@pid":"88/5359","text":"Jorge Castro"},{"@pid":"28/5875","text":"David Guijarro"},{"@pid":"k/JohannesKobler","text":"Johannes Köbler"},{"@pid":"l/WolfgangLindner-2","text":"Wolfgang Lindner 0002"}]},"title":"A general dimension for query learning.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"6","pages":"924-940","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/BalcazarCGKL07","doi":"10.1016/J.JCSS.2007.03.003","ee":"https://doi.org/10.1016/j.jcss.2007.03.003","url":"https://dblp.org/rec/journals/jcss/BalcazarCGKL07"}, "url":"URL#5479693" }, { "@score":"1", "@id":"5479694", "info":{"authors":{"author":[{"@pid":"10/898","text":"Ziv Bar-Yossef"},{"@pid":"54/3895","text":"Marcus Fontoura"},{"@pid":"67/3556","text":"Vanja Josifovski"}]},"title":"On the memory requirements of XPath evaluation over XML streams.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"3","pages":"391-441","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/Bar-YossefFJ07","doi":"10.1016/J.JCSS.2006.10.002","ee":"https://doi.org/10.1016/j.jcss.2006.10.002","url":"https://dblp.org/rec/journals/jcss/Bar-YossefFJ07"}, "url":"URL#5479694" }, { "@score":"1", "@id":"5479695", "info":{"authors":{"author":[{"@pid":"66/1099","text":"Mayank Bawa"},{"@pid":"g/AristidesGionis","text":"Aristides Gionis"},{"@pid":"g/HGarciaMolina","text":"Hector Garcia-Molina"},{"@pid":"m/RajeevMotwani","text":"Rajeev Motwani 0001"}]},"title":"The price of validity in dynamic networks.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"3","pages":"245-264","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/BawaGGM07","doi":"10.1016/J.JCSS.2006.10.007","ee":"https://doi.org/10.1016/j.jcss.2006.10.007","url":"https://dblp.org/rec/journals/jcss/BawaGGM07"}, "url":"URL#5479695" }, { "@score":"1", "@id":"5479696", "info":{"authors":{"author":[{"@pid":"18/3463","text":"Radim Belohlávek"},{"@pid":"38/5719","text":"Jirí Dvorák"},{"@pid":"42/1353","text":"Jan Outrata"}]},"title":"Fast factorization by similarity in formal concept analysis of data with fuzzy attributes.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"6","pages":"1012-1022","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/BelohlavekDO07","doi":"10.1016/J.JCSS.2007.03.016","ee":"https://doi.org/10.1016/j.jcss.2007.03.016","url":"https://dblp.org/rec/journals/jcss/BelohlavekDO07"}, "url":"URL#5479696" }, { "@score":"1", "@id":"5479697", "info":{"authors":{"author":{"@pid":"b/MichaelBenedikt","text":"Michael Benedikt"}},"title":"Database Theory 2004.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"3","pages":"243-244","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/Benedikt07","doi":"10.1016/J.JCSS.2006.10.023","ee":"https://doi.org/10.1016/j.jcss.2006.10.023","url":"https://dblp.org/rec/journals/jcss/Benedikt07"}, "url":"URL#5479697" }, { "@score":"1", "@id":"5479698", "info":{"authors":{"author":[{"@pid":"b/AzzedineBoukerche","text":"Azzedine Boukerche"},{"@pid":"27/2837","text":"Raed Al-Shaikh"},{"@pid":"98/4030","text":"Mirela Sechi Moretti Annoni Notare"}]},"title":"Towards highly available and scalable high performance clusters.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"8","pages":"1240-1251","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/BoukercheAN07","doi":"10.1016/J.JCSS.2007.02.011","ee":"https://doi.org/10.1016/j.jcss.2007.02.011","url":"https://dblp.org/rec/journals/jcss/BoukercheAN07"}, "url":"URL#5479698" }, { "@score":"1", "@id":"5479699", "info":{"authors":{"author":[{"@pid":"b/JoanBoyar","text":"Joan Boyar"},{"@pid":"37/768","text":"Lene M. Favrholdt"},{"@pid":"l/KimSLarsen","text":"Kim S. Larsen"}]},"title":"The relative worst-order ratio applied to paging.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"5","pages":"818-843","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/BoyarFL07","doi":"10.1016/J.JCSS.2007.03.001","ee":"https://doi.org/10.1016/j.jcss.2007.03.001","url":"https://dblp.org/rec/journals/jcss/BoyarFL07"}, "url":"URL#5479699" }, { "@score":"1", "@id":"5479700", "info":{"authors":{"author":[{"@pid":"83/4890","text":"Brona Brejová"},{"@pid":"67/5151-1","text":"Daniel G. Brown 0001"},{"@pid":"22/4895","text":"Tomás Vinar"}]},"title":"The most probable annotation problem in HMMs and its application to bioinformatics.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"7","pages":"1060-1077","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/BrejovaBV07","doi":"10.1016/J.JCSS.2007.03.011","ee":"https://doi.org/10.1016/j.jcss.2007.03.011","url":"https://dblp.org/rec/journals/jcss/BrejovaBV07"}, "url":"URL#5479700" }, { "@score":"1", "@id":"5479701", "info":{"authors":{"author":[{"@pid":"b/VeroniqueBruyere","text":"Véronique Bruyère"},{"@pid":"13/6092","text":"Olivier Carton"}]},"title":"Automata on linear orderings.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"1","pages":"1-24","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/BruyereC07","doi":"10.1016/J.JCSS.2006.10.009","ee":"https://doi.org/10.1016/j.jcss.2006.10.009","url":"https://dblp.org/rec/journals/jcss/BruyereC07"}, "url":"URL#5479701" }, { "@score":"1", "@id":"5479702", "info":{"authors":{"author":[{"@pid":"b/HarryBuhrman","text":"Harry Buhrman"},{"@pid":"27/5687","text":"Hartmut Klauck"},{"@pid":"24/6212","text":"Nikolai K. Vereshchagin"},{"@pid":"v/PMBVitanyi","text":"Paul M. B. Vitányi"}]},"title":"Individual communication complexity.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"6","pages":"973-985","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/BuhrmanKVV07","doi":"10.1016/J.JCSS.2007.03.015","ee":"https://doi.org/10.1016/j.jcss.2007.03.015","url":"https://dblp.org/rec/journals/jcss/BuhrmanKVV07"}, "url":"URL#5479702" }, { "@score":"1", "@id":"5479703", "info":{"authors":{"author":{"@pid":"c/JinyiCai","text":"Jin-yi Cai"}},"title":"S2p is subset of ZPPNP.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"1","pages":"25-35","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/Cai07","doi":"10.1016/J.JCSS.2003.07.015","ee":"https://doi.org/10.1016/j.jcss.2003.07.015","url":"https://dblp.org/rec/journals/jcss/Cai07"}, "url":"URL#5479703" }, { "@score":"1", "@id":"5479704", "info":{"authors":{"author":{"@pid":"04/3166","text":"Denis Xavier Charles"}},"title":"Counting lattice vectors.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"6","pages":"962-972","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/Charles07","doi":"10.1016/J.JCSS.2007.03.014","ee":"https://doi.org/10.1016/j.jcss.2007.03.014","url":"https://dblp.org/rec/journals/jcss/Charles07"}, "url":"URL#5479704" }, { "@score":"1", "@id":"5479705", "info":{"authors":{"author":[{"@pid":"c/JianerChen","text":"Jianer Chen"},{"@pid":"93/86","text":"Iyad A. Kanj"},{"@pid":"31/1371","text":"Ljubomir Perkovic"},{"@pid":"66/4140","text":"Eric Sedgwick"},{"@pid":"74/3428","text":"Ge Xia"}]},"title":"Genus characterizes the complexity of certain graph problems: Some tight results.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"6","pages":"892-907","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/ChenKPSX07","doi":"10.1016/J.JCSS.2006.11.001","ee":"https://doi.org/10.1016/j.jcss.2006.11.001","url":"https://dblp.org/rec/journals/jcss/ChenKPSX07"}, "url":"URL#5479705" }, { "@score":"1", "@id":"5479706", "info":{"authors":{"author":[{"@pid":"80/4313","text":"Sheng-Tzong Cheng"},{"@pid":"76/3773","text":"Ming-Hung Tao"}]},"title":"Quantum cooperative search algorithm for 3-SAT.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"1","pages":"123-136","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/ChengT07","doi":"10.1016/J.JCSS.2006.09.003","ee":"https://doi.org/10.1016/j.jcss.2006.09.003","url":"https://dblp.org/rec/journals/jcss/ChengT07"}, "url":"URL#5479706" }, { "@score":"1", "@id":"5479707", "info":{"authors":{"author":[{"@pid":"40/1039","text":"Edith Cohen"},{"@pid":"48/3950","text":"Haim Kaplan"}]},"title":"Spatially-decaying aggregation over a network.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"3","pages":"265-288","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/CohenK07","doi":"10.1016/J.JCSS.2006.10.016","ee":"https://doi.org/10.1016/j.jcss.2006.10.016","url":"https://dblp.org/rec/journals/jcss/CohenK07"}, "url":"URL#5479707" }, { "@score":"1", "@id":"5479708", "info":{"authors":{"author":[{"@pid":"c/SaraCohen","text":"Sara Cohen"},{"@pid":"26/5086","text":"Yehoshua Sagiv"}]},"title":"An incremental algorithm for computing ranked full disjunctions.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"4","pages":"648-668","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/CohenS07","doi":"10.1016/J.JCSS.2006.10.015","ee":"https://doi.org/10.1016/j.jcss.2006.10.015","url":"https://dblp.org/rec/journals/jcss/CohenS07"}, "url":"URL#5479708" }, { "@score":"1", "@id":"5479709", "info":{"authors":{"author":[{"@pid":"79/4908","text":"Yun Cui"},{"@pid":"40/4750-1","text":"Lusheng Wang 0001"},{"@pid":"91/681","text":"Daming Zhu"}]},"title":"A 1.75-approximation algorithm for unsigned translocation distance.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"7","pages":"1045-1059","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/CuiWZ07","doi":"10.1016/J.JCSS.2007.03.009","ee":"https://doi.org/10.1016/j.jcss.2007.03.009","url":"https://dblp.org/rec/journals/jcss/CuiWZ07"}, "url":"URL#5479709" }, { "@score":"1", "@id":"5479710", "info":{"authors":{"author":[{"@pid":"d/SBDavidson","text":"Susan B. Davidson"},{"@pid":"94/2372","text":"Wenfei Fan"},{"@pid":"26/3914","text":"Carmem S. Hara"}]},"title":"Propagating XML constraints to relations.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"3","pages":"316-361","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/DavidsonFH07","doi":"10.1016/J.JCSS.2006.10.022","ee":"https://doi.org/10.1016/j.jcss.2006.10.022","url":"https://dblp.org/rec/journals/jcss/DavidsonFH07"}, "url":"URL#5479710" }, { "@score":"1", "@id":"5479711", "info":{"authors":{"author":[{"@pid":"d/AlinDeutsch","text":"Alin Deutsch"},{"@pid":"70/2061","text":"Liying Sui"},{"@pid":"v/VictorVianu","text":"Victor Vianu"}]},"title":"Specification and verification of data-driven Web applications.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"3","pages":"442-474","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/DeutschSV07","doi":"10.1016/J.JCSS.2006.10.006","ee":"https://doi.org/10.1016/j.jcss.2006.10.006","url":"https://dblp.org/rec/journals/jcss/DeutschSV07"}, "url":"URL#5479711" }, { "@score":"1", "@id":"5479712", "info":{"authors":{"author":[{"@pid":"d/RodneyGDowney","text":"Rodney G. Downey"},{"@pid":"47/5632","text":"Denis R. Hirschfeldt"},{"@pid":"22/5485","text":"Geoffrey LaForte"}]},"title":"Undecidability of the structure of the Solovay degrees of c.e. reals.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"5","pages":"769-787","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/DowneyHL07","doi":"10.1016/J.JCSS.2007.01.002","ee":"https://doi.org/10.1016/j.jcss.2007.01.002","url":"https://dblp.org/rec/journals/jcss/DowneyHL07"}, "url":"URL#5479712" }, { "@score":"1", "@id":"5479713", "info":{"authors":{"author":[{"@pid":"d/RodneyGDowney","text":"Rodney G. Downey"},{"@pid":"42/1539","text":"Catherine McCartin"}]},"title":"Online promise problems with online width metrics.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"1","pages":"57-72","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/DowneyM07","doi":"10.1016/J.JCSS.2006.08.002","ee":"https://doi.org/10.1016/j.jcss.2006.08.002","url":"https://dblp.org/rec/journals/jcss/DowneyM07"}, "url":"URL#5479713" }, { "@score":"1", "@id":"5479714", "info":{"authors":{"author":[{"@pid":"f/WolfgangFaber","text":"Wolfgang Faber 0001"},{"@pid":"17/1770","text":"Gianluigi Greco"},{"@pid":"l/NicolaLeone","text":"Nicola Leone"}]},"title":"Magic Sets and their application to data integration.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"4","pages":"584-609","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/FaberGL07","doi":"10.1016/J.JCSS.2006.10.012","ee":"https://doi.org/10.1016/j.jcss.2006.10.012","url":"https://dblp.org/rec/journals/jcss/FaberGL07"}, "url":"URL#5479714" }, { "@score":"1", "@id":"5479715", "info":{"authors":{"author":[{"@pid":"f/MartinFarachColton","text":"Martin Farach-Colton"},{"@pid":"l/GadMLandau","text":"Gad M. Landau"},{"@pid":"s/SCSahinalp","text":"Süleyman Cenk Sahinalp"},{"@pid":"04/5238","text":"Dekel Tsur"}]},"title":"Optimal spaced seeds for faster approximate string matching.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"7","pages":"1035-1044","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/Farach-ColtonLST07","doi":"10.1016/J.JCSS.2007.03.007","ee":"https://doi.org/10.1016/j.jcss.2007.03.007","url":"https://dblp.org/rec/journals/jcss/Farach-ColtonLST07"}, "url":"URL#5479715" }, { "@score":"1", "@id":"5479716", "info":{"authors":{"author":[{"@pid":"15/3253","text":"J. Nathan Foster"},{"@pid":"g/MichaelBGreenwald","text":"Michael B. Greenwald"},{"@pid":"29/404","text":"Christian Kirkegaard"},{"@pid":"p/BenjaminCPierce","text":"Benjamin C. Pierce"},{"@pid":"36/5932","text":"Alan Schmitt"}]},"title":"Exploiting schemas in data synchronization.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"4","pages":"669-689","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/FosterGKPS07","doi":"10.1016/J.JCSS.2006.10.024","ee":"https://doi.org/10.1016/j.jcss.2006.10.024","url":"https://dblp.org/rec/journals/jcss/FosterGKPS07"}, "url":"URL#5479716" }, { "@score":"1", "@id":"5479717", "info":{"authors":{"author":[{"@pid":"90/1367","text":"Ariel Fuxman"},{"@pid":"m/RJMiller","text":"Renée J. Miller"}]},"title":"First-order query rewriting for inconsistent databases.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"4","pages":"610-635","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/FuxmanM07","doi":"10.1016/J.JCSS.2006.10.013","ee":"https://doi.org/10.1016/j.jcss.2006.10.013","url":"https://dblp.org/rec/journals/jcss/FuxmanM07"}, "url":"URL#5479717" }, { "@score":"1", "@id":"5479718", "info":{"authors":{"author":[{"@pid":"51/3192","text":"Christopher D. Gill"},{"@pid":"31/4030","text":"Oleg Sokolsky"}]},"title":"Guest Editors' Foreword.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"2","pages":"155","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/GillS07","doi":"10.1016/J.JCSS.2006.04.004","ee":"https://doi.org/10.1016/j.jcss.2006.04.004","url":"https://dblp.org/rec/journals/jcss/GillS07"}, "url":"URL#5479718" }, { "@score":"1", "@id":"5479719", "info":{"authors":{"author":{"@pid":"g/ChristianGlasser","text":"Christian Glaßer"}},"title":"Languages polylog-time reducible to dot-depth 1/2.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"1","pages":"36-56","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/Glasser07","doi":"10.1016/J.JCSS.2006.09.004","ee":"https://doi.org/10.1016/j.jcss.2006.09.004","url":"https://dblp.org/rec/journals/jcss/Glasser07"}, "url":"URL#5479719" }, { "@score":"1", "@id":"5479720", "info":{"authors":{"author":[{"@pid":"g/ChristianGlasser","text":"Christian Glaßer"},{"@pid":"o/MitsunoriOgihara","text":"Mitsunori Ogihara"},{"@pid":"88/1807","text":"Aduri Pavan"},{"@pid":"s/AlanLSelman","text":"Alan L. Selman"},{"@pid":"00/943","text":"Liyu Zhang"}]},"title":"Autoreducibility, mitoticity, and immunity.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"5","pages":"735-754","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/GlasserOPSZ07","doi":"10.1016/J.JCSS.2006.10.020","ee":"https://doi.org/10.1016/j.jcss.2006.10.020","url":"https://dblp.org/rec/journals/jcss/GlasserOPSZ07"}, "url":"URL#5479720" }, { "@score":"1", "@id":"5479721", "info":{"authors":{"author":[{"@pid":"g/ParkeGodfrey","text":"Parke Godfrey"},{"@pid":"g/JarekGryz","text":"Jarek Gryz"}]},"title":"View disassembly: A rewrite that extracts portions of views.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"6","pages":"941-961","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/GodfreyG07","doi":"10.1016/J.JCSS.2007.03.002","ee":"https://doi.org/10.1016/j.jcss.2007.03.002","url":"https://dblp.org/rec/journals/jcss/GodfreyG07"}, "url":"URL#5479721" }, { "@score":"1", "@id":"5479722", "info":{"authors":{"author":[{"@pid":"40/3527","text":"Maziar Goudarzi"},{"@pid":"46/1616","text":"Naser MohammadZadeh"},{"@pid":"18/731","text":"Shaahin Hessabi"}]},"title":"Using on-chip networks to implement polymorphism in the co-design of object-oriented embedded systems.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"8","pages":"1221-1231","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/GoudarziMH07","doi":"10.1016/J.JCSS.2007.02.009","ee":"https://doi.org/10.1016/j.jcss.2007.02.009","url":"https://dblp.org/rec/journals/jcss/GoudarziMH07"}, "url":"URL#5479722" }, { "@score":"1", "@id":"5479723", "info":{"authors":{"author":[{"@pid":"86/5146","text":"Gregor Gramlich"},{"@pid":"03/3584","text":"Georg Schnitger"}]},"title":"Minimizing nfa's and regular expressions.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"6","pages":"908-923","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/GramlichS07","doi":"10.1016/J.JCSS.2006.11.002","ee":"https://doi.org/10.1016/j.jcss.2006.11.002","url":"https://dblp.org/rec/journals/jcss/GramlichS07"}, "url":"URL#5479723" }, { "@score":"1", "@id":"5479724", "info":{"authors":{"author":[{"@pid":"334/4488","text":"MohammadTaghi Hajiaghayi"},{"@pid":"n/NaomiNishimura","text":"Naomi Nishimura"}]},"title":"Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"5","pages":"755-768","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/HajiaghayiN07","doi":"10.1016/J.JCSS.2007.01.003","ee":"https://doi.org/10.1016/j.jcss.2007.01.003","url":"https://dblp.org/rec/journals/jcss/HajiaghayiN07"}, "url":"URL#5479724" }, { "@score":"1", "@id":"5479725", "info":{"authors":{"author":[{"@pid":"19/4155","text":"Valentina S. Harizanov"},{"@pid":"s/FrankStephan","text":"Frank Stephan 0001"}]},"title":"On the learnability of vector spaces.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"1","pages":"109-122","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/HarizanovS07","doi":"10.1016/J.JCSS.2006.09.001","ee":"https://doi.org/10.1016/j.jcss.2006.09.001","url":"https://dblp.org/rec/journals/jcss/HarizanovS07"}, "url":"URL#5479725" }, { "@score":"1", "@id":"5479726", "info":{"authors":{"author":[{"@pid":"h/EdithHemaspaandra","text":"Edith Hemaspaandra"},{"@pid":"h/LaneAHemaspaandra","text":"Lane A. Hemaspaandra"}]},"title":"Dichotomy for voting systems.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"1","pages":"73-83","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/HemaspaandraH07","doi":"10.1016/J.JCSS.2006.09.002","ee":"https://doi.org/10.1016/j.jcss.2006.09.002","url":"https://dblp.org/rec/journals/jcss/HemaspaandraH07"}, "url":"URL#5479726" }, { "@score":"1", "@id":"5479727", "info":{"authors":{"author":[{"@pid":"h/FrankKHwang","text":"Frank K. Hwang"},{"@pid":"74/5021","text":"F. H. Chang"}]},"title":"The identification of positive clones in a general inhibitor model.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"7","pages":"1090-1094","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/HwangC07","doi":"10.1016/J.JCSS.2007.03.005","ee":"https://doi.org/10.1016/j.jcss.2007.03.005","url":"https://dblp.org/rec/journals/jcss/HwangC07"}, "url":"URL#5479727" }, { "@score":"1", "@id":"5479728", "info":{"authors":{"author":[{"@pid":"28/2411","text":"Yasunori Ishihara"},{"@pid":"12/3732","text":"Toshiyuki Morita"},{"@pid":"09/4711","text":"Hiroyuki Seki"},{"@pid":"71/1470","text":"Minoru Ito"}]},"title":"An equational logic based approach to the security problem against inference attacks on object-oriented databases.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"5","pages":"788-817","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/IshiharaMSI07","doi":"10.1016/J.JCSS.2007.01.001","ee":"https://doi.org/10.1016/j.jcss.2007.01.001","url":"https://dblp.org/rec/journals/jcss/IshiharaMSI07"}, "url":"URL#5479728" }, { "@score":"1", "@id":"5479729", "info":{"authors":{"author":[{"@pid":"j/SanjayJain1","text":"Sanjay Jain 0001"},{"@pid":"89/4629","text":"Yen Kaow Ng"},{"@pid":"41/2553","text":"Tiong Seng Tay"}]},"title":"Learning languages in a union.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"1","pages":"89-108","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/JainNT07","doi":"10.1016/J.JCSS.2006.01.005","ee":"https://doi.org/10.1016/j.jcss.2006.01.005","url":"https://dblp.org/rec/journals/jcss/JainNT07"}, "url":"URL#5479729" }, { "@score":"1", "@id":"5479730", "info":{"authors":{"author":[{"@pid":"10/6360","text":"Yu Jiao"},{"@pid":"h/AliRHurson","text":"Ali R. Hurson"}]},"title":"Energy-efficient wireless information retrieval.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"8","pages":"1145-1163","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/JiaoH07","doi":"10.1016/J.JCSS.2007.02.004","ee":"https://doi.org/10.1016/j.jcss.2007.02.004","url":"https://dblp.org/rec/journals/jcss/JiaoH07"}, "url":"URL#5479730" }, { "@score":"1", "@id":"5479731", "info":{"authors":{"author":[{"@pid":"00/1728","text":"Xiaolong Jin"},{"@pid":"96/3727","text":"Geyong Min"}]},"title":"Performance analysis of priority scheduling mechanisms under heterogeneous network traffic.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"8","pages":"1207-1220","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/JinM07","doi":"10.1016/J.JCSS.2007.02.008","ee":"https://doi.org/10.1016/j.jcss.2007.02.008","url":"https://dblp.org/rec/journals/jcss/JinM07"}, "url":"URL#5479731" }, { "@score":"1", "@id":"5479732", "info":{"authors":{"author":[{"@pid":"j/PeterJonsson","text":"Peter Jonsson"},{"@pid":"k/AAKrokhin","text":"Andrei A. Krokhin"}]},"title":"Maximum H-colourable subdigraphs and constraint optimization with arbitrary weights.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"5","pages":"691-702","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/JonssonK07","doi":"10.1016/J.JCSS.2007.02.001","ee":"https://doi.org/10.1016/j.jcss.2007.02.001","url":"https://dblp.org/rec/journals/jcss/JonssonK07"}, "url":"URL#5479732" }, { "@score":"1", "@id":"5479733", "info":{"authors":{"author":[{"@pid":"k/RichardMKarp","text":"Richard M. Karp"},{"@pid":"181/2821","text":"Ming Li"},{"@pid":"p/PAPevzner","text":"Pavel A. Pevzner"},{"@pid":"66/6913","text":"Ron Shamir"}]},"title":"Special issue on computational molecular biology.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"7","pages":"1023","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/KarpLPS07","doi":"10.1016/J.JCSS.2007.03.010","ee":"https://doi.org/10.1016/j.jcss.2007.03.010","url":"https://dblp.org/rec/journals/jcss/KarpLPS07"}, "url":"URL#5479733" }, { "@score":"1", "@id":"5479734", "info":{"authors":{"author":{"@pid":"76/3493","text":"Telikepalli Kavitha"}},"title":"Linear time algorithms for Abelian group isomorphism and related problems.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"6","pages":"986-996","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/Kavitha07","doi":"10.1016/J.JCSS.2007.03.013","ee":"https://doi.org/10.1016/j.jcss.2007.03.013","url":"https://dblp.org/rec/journals/jcss/Kavitha07"}, "url":"URL#5479734" }, { "@score":"1", "@id":"5479735", "info":{"authors":{"author":{"@pid":"25/498","text":"Solmaz Kolahi"}},"title":"Dependency-preserving normalization of relational and XML data.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"4","pages":"636-647","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/Kolahi07","doi":"10.1016/J.JCSS.2006.10.014","ee":"https://doi.org/10.1016/j.jcss.2006.10.014","url":"https://dblp.org/rec/journals/jcss/Kolahi07"}, "url":"URL#5479735" }, { "@score":"1", "@id":"5479736", "info":{"authors":{"author":[{"@pid":"71/4080","text":"Gabriel M. Kuper"},{"@pid":"s/JWSu","text":"Jianwen Su"}]},"title":"A representation independent language for planar spatial databases with Euclidean distance.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"6","pages":"845-874","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/KuperS07","doi":"10.1016/J.JCSS.2006.10.008","ee":"https://doi.org/10.1016/j.jcss.2006.10.008","url":"https://dblp.org/rec/journals/jcss/KuperS07"}, "url":"URL#5479736" }, { "@score":"1", "@id":"5479737", "info":{"authors":{"author":[{"@pid":"l/GadMLandau","text":"Gad M. Landau"},{"@pid":"m/EugeneWMyers","text":"Eugene W. Myers"},{"@pid":"88/982","text":"Michal Ziv-Ukelson"}]},"title":"Two algorithms for LCS Consecutive Suffix Alignment.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"7","pages":"1095-1117","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/LandauMZ07","doi":"10.1016/J.JCSS.2007.03.004","ee":"https://doi.org/10.1016/j.jcss.2007.03.004","url":"https://dblp.org/rec/journals/jcss/LandauMZ07"}, "url":"URL#5479737" }, { "@score":"1", "@id":"5479738", "info":{"authors":{"author":[{"@pid":"82/6171","text":"Dirk Leinders"},{"@pid":"b/JVdBussche","text":"Jan Van den Bussche"}]},"title":"On the complexity of division and set joins in the relational algebra.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"4","pages":"538-549","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/LeindersB07","doi":"10.1016/J.JCSS.2006.10.011","ee":"https://doi.org/10.1016/j.jcss.2006.10.011","url":"https://dblp.org/rec/journals/jcss/LeindersB07"}, "url":"URL#5479738" }, { "@score":"1", "@id":"5479739", "info":{"authors":{"author":[{"@pid":"l/StefanoLeonardi","text":"Stefano Leonardi 0001"},{"@pid":"r/DannyRaz","text":"Danny Raz"}]},"title":"Approximating total flow time on parallel machines.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"6","pages":"875-891","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/LeonardiR07","doi":"10.1016/J.JCSS.2006.10.018","ee":"https://doi.org/10.1016/j.jcss.2006.10.018","url":"https://dblp.org/rec/journals/jcss/LeonardiR07"}, "url":"URL#5479739" }, { "@score":"1", "@id":"5479740", "info":{"authors":{"author":[{"@pid":"00/3361","text":"Lin Lin"},{"@pid":"87/7825","text":"Xue-Hai Yuan"},{"@pid":"38/4523","text":"Zun-Quan Xia"}]},"title":"Multicriteria fuzzy decision-making methods based on intuitionistic fuzzy sets.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"1","pages":"84-88","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/LinYX07","doi":"10.1016/J.JCSS.2006.03.004","ee":"https://doi.org/10.1016/j.jcss.2006.03.004","url":"https://dblp.org/rec/journals/jcss/LinYX07"}, "url":"URL#5479740" }, { "@score":"1", "@id":"5479741", "info":{"authors":{"author":[{"@pid":"31/6932","text":"Kai Lu"},{"@pid":"04/3780","text":"Riky Subrata"},{"@pid":"z/AlbertYZomaya","text":"Albert Y. Zomaya"}]},"title":"On the performance-driven load distribution for heterogeneous computational grids.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"8","pages":"1191-1206","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/LuSZ07","doi":"10.1016/J.JCSS.2007.02.007","ee":"https://doi.org/10.1016/j.jcss.2007.02.007","url":"https://dblp.org/rec/journals/jcss/LuSZ07"}, "url":"URL#5479741" }, { "@score":"1", "@id":"5479742", "info":{"authors":{"author":[{"@pid":"70/6176-2","text":"Bin Ma 0002"},{"@pid":"l/MingLi1","text":"Ming Li 0001"}]},"title":"On the complexity of the spaced seeds.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"7","pages":"1024-1034","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/MaL07","doi":"10.1016/J.JCSS.2007.03.008","ee":"https://doi.org/10.1016/j.jcss.2007.03.008","url":"https://dblp.org/rec/journals/jcss/MaL07"}, "url":"URL#5479742" }, { "@score":"1", "@id":"5479743", "info":{"authors":{"author":[{"@pid":"70/6176-2","text":"Bin Ma 0002"},{"@pid":"40/4750-1","text":"Lusheng Wang 0001"},{"@pid":"l/MingLi1","text":"Ming Li 0001"}]},"title":"Near optimal multiple alignment within a band in polynomial time.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"6","pages":"997-1011","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/MaWL07","doi":"10.1016/J.JCSS.2007.03.012","ee":"https://doi.org/10.1016/j.jcss.2007.03.012","url":"https://dblp.org/rec/journals/jcss/MaWL07"}, "url":"URL#5479743" }, { "@score":"1", "@id":"5479744", "info":{"authors":{"author":[{"@pid":"95/3517","text":"Wim Martens"},{"@pid":"n/FrankNeven","text":"Frank Neven"}]},"title":"Frontiers of tractability for typechecking simple XML transformations.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"3","pages":"362-390","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/MartensN07","doi":"10.1016/J.JCSS.2006.10.005","ee":"https://doi.org/10.1016/j.jcss.2006.10.005","url":"https://dblp.org/rec/journals/jcss/MartensN07"}, "url":"URL#5479744" }, { "@score":"1", "@id":"5479745", "info":{"authors":{"author":[{"@pid":"95/3517","text":"Wim Martens"},{"@pid":"n/JNiehren","text":"Joachim Niehren"}]},"title":"On the minimization of XML Schemas and tree automata for unranked trees.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"4","pages":"550-583","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/MartensN07a","doi":"10.1016/J.JCSS.2006.10.021","ee":"https://doi.org/10.1016/j.jcss.2006.10.021","url":"https://dblp.org/rec/journals/jcss/MartensN07a"}, "url":"URL#5479745" }, { "@score":"1", "@id":"5479746", "info":{"authors":{"author":[{"@pid":"m/GeromeMiklau","text":"Gerome Miklau"},{"@pid":"s/DanSuciu","text":"Dan Suciu"}]},"title":"A formal analysis of information disclosure in data exchange.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"3","pages":"507-534","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/MiklauS07","doi":"10.1016/J.JCSS.2006.10.004","ee":"https://doi.org/10.1016/j.jcss.2006.10.004","url":"https://dblp.org/rec/journals/jcss/MiklauS07"}, "url":"URL#5479746" }, { "@score":"1", "@id":"5479747", "info":{"authors":{"author":[{"@pid":"m/ShlomoMoran","text":"Shlomo Moran"},{"@pid":"18/913","text":"Sagi Snir"}]},"title":"Efficient approximation of convex recolorings.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"7","pages":"1078-1089","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/MoranS07","doi":"10.1016/J.JCSS.2007.03.006","ee":"https://doi.org/10.1016/j.jcss.2007.03.006","url":"https://dblp.org/rec/journals/jcss/MoranS07"}, "url":"URL#5479747" }, { "@score":"1", "@id":"5479748", "info":{"authors":{"author":[{"@pid":"40/1470","text":"Rafael Moreno-Vozmediano"},{"@pid":"64/6661","text":"Krishna Nadiminti"},{"@pid":"00/4394","text":"Srikumar Venugopal"},{"@pid":"15/4799","text":"Ana B. Alonso-Conde"},{"@pid":"34/473","text":"Hussein Gibbins"},{"@pid":"b/RajkumarBuyya","text":"Rajkumar Buyya"}]},"title":"Portfolio and investment risk analysis on global grids.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"8","pages":"1164-1175","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/Moreno-VozmedianoNVAGB07","doi":"10.1016/J.JCSS.2007.02.005","ee":"https://doi.org/10.1016/j.jcss.2007.02.005","url":"https://dblp.org/rec/journals/jcss/Moreno-VozmedianoNVAGB07"}, "url":"URL#5479748" }, { "@score":"1", "@id":"5479749", "info":{"authors":{"author":[{"@pid":"25/3790","text":"Rodolfo Pellizzoni"},{"@pid":"20/4726","text":"Giuseppe Lipari"}]},"title":"Holistic analysis of asynchronous real-time transactions with earliest deadline scheduling.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"2","pages":"186-206","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/PellizzoniL07","doi":"10.1016/J.JCSS.2006.04.002","ee":"https://doi.org/10.1016/j.jcss.2006.04.002","url":"https://dblp.org/rec/journals/jcss/PellizzoniL07"}, "url":"URL#5479749" }, { "@score":"1", "@id":"5479750", "info":{"authors":{"author":[{"@pid":"41/4838","text":"Farshad Safaei"},{"@pid":"96/4551","text":"Ahmad Khonsari"},{"@pid":"84/299","text":"Mahmood Fathy"},{"@pid":"02/3730","text":"Mohamed Ould-Khaoua"}]},"title":"Communication delay analysis of fault-tolerant pipelined circuit switching in torus.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"8","pages":"1131-1144","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/SafaeiKFO07","doi":"10.1016/J.JCSS.2007.02.003","ee":"https://doi.org/10.1016/j.jcss.2007.02.003","url":"https://dblp.org/rec/journals/jcss/SafaeiKFO07"}, "url":"URL#5479750" }, { "@score":"1", "@id":"5479751", "info":{"authors":{"author":[{"@pid":"36/139","text":"Hamid Sarbazi-Azad"},{"@pid":"19/4488","text":"Lewis M. Mackenzie"}]},"title":"Network-based computing.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"8","pages":"1119-1120","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/Sarbazi-AzadM07","doi":"10.1016/J.JCSS.2007.02.012","ee":"https://doi.org/10.1016/j.jcss.2007.02.012","url":"https://dblp.org/rec/journals/jcss/Sarbazi-AzadM07"}, "url":"URL#5479751" }, { "@score":"1", "@id":"5479752", "info":{"authors":{"author":[{"@pid":"71/3711","text":"Francesco Scarcello"},{"@pid":"17/1770","text":"Gianluigi Greco"},{"@pid":"l/NicolaLeone","text":"Nicola Leone"}]},"title":"Weighted hypertree decompositions and optimal query plans.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"3","pages":"475-506","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/ScarcelloGL07","doi":"10.1016/J.JCSS.2006.10.010","ee":"https://doi.org/10.1016/j.jcss.2006.10.010","url":"https://dblp.org/rec/journals/jcss/ScarcelloGL07"}, "url":"URL#5479752" }, { "@score":"1", "@id":"5479753", "info":{"authors":{"author":{"@pid":"s/TSchwentick","text":"Thomas Schwentick"}},"title":"Automata for XML - A survey.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"3","pages":"289-315","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/Schwentick07","doi":"10.1016/J.JCSS.2006.10.003","ee":"https://doi.org/10.1016/j.jcss.2006.10.003","url":"https://dblp.org/rec/journals/jcss/Schwentick07"}, "url":"URL#5479753" }, { "@score":"1", "@id":"5479754", "info":{"authors":{"author":[{"@pid":"89/7033","text":"Petr Sosík"},{"@pid":"55/5282","text":"Alfonso Rodríguez-Patón"}]},"title":"Membrane computing and complexity theory: A characterization of PSPACE.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"1","pages":"137-152","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/SosikR07","doi":"10.1016/J.JCSS.2006.10.001","ee":"https://doi.org/10.1016/j.jcss.2006.10.001","url":"https://dblp.org/rec/journals/jcss/SosikR07"}, "url":"URL#5479754" }, { "@score":"1", "@id":"5479755", "info":{"authors":{"author":[{"@pid":"04/3780","text":"Riky Subrata"},{"@pid":"z/AlbertYZomaya","text":"Albert Y. Zomaya"},{"@pid":"l/BjornLandfeldt","text":"Björn Landfeldt"}]},"title":"Artificial life techniques for load balancing in computational grids.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"8","pages":"1176-1190","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/SubrataZL07","doi":"10.1016/J.JCSS.2007.02.006","ee":"https://doi.org/10.1016/j.jcss.2007.02.006","url":"https://dblp.org/rec/journals/jcss/SubrataZL07"}, "url":"URL#5479755" }, { "@score":"1", "@id":"5479756", "info":{"authors":{"author":{"@pid":"s/DanSuciu","text":"Dan Suciu"}},"title":"Special issue on database theory.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"4","pages":"537","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/Suciu07","doi":"10.1016/J.JCSS.2006.10.025","ee":"https://doi.org/10.1016/j.jcss.2006.10.025","url":"https://dblp.org/rec/journals/jcss/Suciu07"}, "url":"URL#5479756" }, { "@score":"1", "@id":"5479757", "info":{"authors":{"author":[{"@pid":"25/4819","text":"Ernesto Wandeler"},{"@pid":"t/LotharThiele","text":"Lothar Thiele"}]},"title":"Workload correlations in multi-processor hard real-time systems.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"2","pages":"207-224","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/WandelerT07","doi":"10.1016/J.JCSS.2006.04.005","ee":"https://doi.org/10.1016/j.jcss.2006.04.005","url":"https://dblp.org/rec/journals/jcss/WandelerT07"}, "url":"URL#5479757" }, { "@score":"1", "@id":"5479758", "info":{"authors":{"author":[{"@pid":"45/3237","text":"Wenjun Xiao"},{"@pid":"p/BehroozParhami","text":"Behrooz Parhami"}]},"title":"Structural properties of Cayley digraphs with applications to mesh and pruned torus interconnection networks.","venue":"J. Comput. Syst. Sci.","volume":"73","number":"8","pages":"1232-1239","year":"2007","type":"Journal Articles","access":"open","key":"journals/jcss/XiaoP07","doi":"10.1016/J.JCSS.2007.02.010","ee":"https://doi.org/10.1016/j.jcss.2007.02.010","url":"https://dblp.org/rec/journals/jcss/XiaoP07"}, "url":"URL#5479758" } ] } } } )