callback( { "result":{ "query":":facetid:toc:\"db/journals/iandc/iandc130.bht\"", "status":{ "@code":"200", "text":"OK" }, "time":{ "@unit":"msecs", "text":"72.04" }, "completions":{ "@total":"1", "@computed":"1", "@sent":"1", "c":{ "@sc":"9", "@dc":"9", "@oc":"9", "@id":"43440684", "text":":facetid:toc:db/journals/iandc/iandc130.bht" } }, "hits":{ "@total":"9", "@computed":"9", "@sent":"9", "@first":"0", "hit":[{ "@score":"1", "@id":"6682451", "info":{"authors":{"author":[{"@pid":"a/PAAbdulla","text":"Parosh Aziz Abdulla"},{"@pid":"j/BengtJonsson","text":"Bengt Jonsson 0001"}]},"title":"Undecidable Verification Problems for Programs with Unreliable Channels.","venue":"Inf. Comput.","volume":"130","number":"1","pages":"71-90","year":"1996","type":"Journal Articles","access":"open","key":"journals/iandc/AbdullaJ96a","doi":"10.1006/INCO.1996.0083","ee":"https://doi.org/10.1006/inco.1996.0083","url":"https://dblp.org/rec/journals/iandc/AbdullaJ96a"}, "url":"URL#6682451" }, { "@score":"1", "@id":"6682462", "info":{"authors":{"author":[{"@pid":"b/PaulBeame","text":"Paul Beame"},{"@pid":"02/5164","text":"Allan Borodin"},{"@pid":"r/PRaghavan","text":"Prabhakar Raghavan"},{"@pid":"r/WalterLRuzzo","text":"Walter L. Ruzzo"},{"@pid":"t/MartinTompa","text":"Martin Tompa"}]},"title":"Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata.","venue":"Inf. Comput.","volume":"130","number":"2","pages":"101-129","year":"1996","type":"Journal Articles","access":"open","key":"journals/iandc/BeameBRRT96","doi":"10.1006/INCO.1996.0085","ee":"https://doi.org/10.1006/inco.1996.0085","url":"https://dblp.org/rec/journals/iandc/BeameBRRT96"}, "url":"URL#6682462" }, { "@score":"1", "@id":"6682471", "info":{"authors":{"author":[{"@pid":"b/VeroniqueBruyere","text":"Véronique Bruyère"},{"@pid":"f/CleliadeFelice","text":"Clelia de Felice"}]},"title":"Any Lifting of a Trace Coding is a Word Coding.","venue":"Inf. Comput.","volume":"130","number":"2","pages":"183-193","year":"1996","type":"Journal Articles","access":"open","key":"journals/iandc/BruyereF96","doi":"10.1006/INCO.1996.0088","ee":"https://doi.org/10.1006/inco.1996.0088","url":"https://dblp.org/rec/journals/iandc/BruyereF96"}, "url":"URL#6682471" }, { "@score":"1", "@id":"6682478", "info":{"authors":{"author":[{"@pid":"d/CarstenDamm","text":"Carsten Damm"},{"@pid":"h/MarkusHolzer1","text":"Markus Holzer 0001"}]},"title":"Inductive Counting for Width-Restricted Branching Programs.","venue":"Inf. Comput.","volume":"130","number":"1","pages":"91-99","year":"1996","type":"Journal Articles","access":"open","key":"journals/iandc/DammH96","doi":"10.1006/INCO.1996.0084","ee":"https://doi.org/10.1006/inco.1996.0084","url":"https://dblp.org/rec/journals/iandc/DammH96"}, "url":"URL#6682478" }, { "@score":"1", "@id":"6682481", "info":{"authors":{"author":[{"@pid":"f/SAFenner","text":"Stephen A. Fenner"},{"@pid":"f/LanceFortnow","text":"Lance Fortnow"},{"@pid":"41/2373","text":"Lide Li"}]},"title":"Gap-Definability as a Closure Property.","venue":"Inf. Comput.","volume":"130","number":"1","pages":"1-17","year":"1996","type":"Journal Articles","access":"open","key":"journals/iandc/FennerFL96","doi":"10.1006/INCO.1996.0080","ee":"https://doi.org/10.1006/inco.1996.0080","url":"https://dblp.org/rec/journals/iandc/FennerFL96"}, "url":"URL#6682481" }, { "@score":"1", "@id":"6682489", "info":{"authors":{"author":[{"@pid":"g/RaffaeleGiancarlo","text":"Raffaele Giancarlo"},{"@pid":"g/RobertoGrossi","text":"Roberto Grossi"}]},"title":"On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications.","venue":"Inf. Comput.","volume":"130","number":"2","pages":"151-182","year":"1996","type":"Journal Articles","access":"open","key":"journals/iandc/GiancarloG96","doi":"10.1006/INCO.1996.0087","ee":"https://doi.org/10.1006/inco.1996.0087","url":"https://dblp.org/rec/journals/iandc/GiancarloG96"}, "url":"URL#6682489" }, { "@score":"1", "@id":"6682503", "info":{"authors":{"author":[{"@pid":"j/SanjayJain1","text":"Sanjay Jain 0001"},{"@pid":"20/6874-1","text":"Arun Sharma 0001"}]},"title":"Computational Limits on Team Identification of Languages.","venue":"Inf. Comput.","volume":"130","number":"1","pages":"19-60","year":"1996","type":"Journal Articles","access":"open","key":"journals/iandc/JainS96","doi":"10.1006/INCO.1996.0081","ee":"https://doi.org/10.1006/inco.1996.0081","url":"https://dblp.org/rec/journals/iandc/JainS96"}, "url":"URL#6682503" }, { "@score":"1", "@id":"6682533", "info":{"authors":{"author":{"@pid":"27/3868","text":"Farn Wang"}},"title":"Parametric Timing Analysis for Real-Time Systems.","venue":"Inf. Comput.","volume":"130","number":"2","pages":"131-150","year":"1996","type":"Journal Articles","access":"open","key":"journals/iandc/Wang96","doi":"10.1006/INCO.1996.0086","ee":"https://doi.org/10.1006/inco.1996.0086","url":"https://dblp.org/rec/journals/iandc/Wang96"}, "url":"URL#6682533" }, { "@score":"1", "@id":"6682534", "info":{"authors":{"author":[{"@pid":"w/ThomasWilke","text":"Thomas Wilke"},{"@pid":"49/2341","text":"Haiseung Yoo"}]},"title":"Computing the Rabin Index of a Regular Language of Infinite Words.","venue":"Inf. Comput.","volume":"130","number":"1","pages":"61-70","year":"1996","type":"Journal Articles","access":"open","key":"journals/iandc/WilkeY96","doi":"10.1006/INCO.1996.0082","ee":"https://doi.org/10.1006/inco.1996.0082","url":"https://dblp.org/rec/journals/iandc/WilkeY96"}, "url":"URL#6682534" } ] } } } )