callback( { "result":{ "query":":facetid:toc:\"db/conf/fsttcs/fsttcs91.bht\"", "status":{ "@code":"200", "text":"OK" }, "time":{ "@unit":"msecs", "text":"191.07" }, "completions":{ "@total":"1", "@computed":"1", "@sent":"1", "c":{ "@sc":"29", "@dc":"29", "@oc":"29", "@id":"43395771", "text":":facetid:toc:db/conf/fsttcs/fsttcs91.bht" } }, "hits":{ "@total":"29", "@computed":"29", "@sent":"29", "@first":"0", "hit":[{ "@score":"1", "@id":"6917300", "info":{"authors":{"author":[{"@pid":"a/LucaAceto","text":"Luca Aceto"},{"@pid":"05/2590","text":"Uffe Engberg"}]},"title":"Failures Semantics for a Simple Process Language with Refinement.","venue":"FSTTCS","pages":"89-108","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/AcetoE91","doi":"10.1007/3-540-54967-6_63","ee":"https://doi.org/10.1007/3-540-54967-6_63","url":"https://dblp.org/rec/conf/fsttcs/AcetoE91"}, "url":"URL#6917300" }, { "@score":"1", "@id":"6917301", "info":{"authors":{"author":{"@pid":"a/ManindraAgrawal","text":"Manindra Agrawal"}},"title":"NP-hard Sets and Creativeness over Constant Time Languages.","venue":"FSTTCS","pages":"224-241","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/Agrawal91","doi":"10.1007/3-540-54967-6_71","ee":"https://doi.org/10.1007/3-540-54967-6_71","url":"https://dblp.org/rec/conf/fsttcs/Agrawal91"}, "url":"URL#6917301" }, { "@score":"1", "@id":"6917302", "info":{"authors":{"author":{"@pid":"b/BinayKBhattacharya","text":"Binay K. Bhattacharya"}},"title":"Usefulness of Angle-Sweep over Line-Sweep.","venue":"FSTTCS","pages":"390-419","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/Bhattacharya91","doi":"10.1007/3-540-54967-6_83","ee":"https://doi.org/10.1007/3-540-54967-6_83","url":"https://dblp.org/rec/conf/fsttcs/Bhattacharya91"}, "url":"URL#6917302" }, { "@score":"1", "@id":"6917303", "info":{"authors":{"author":[{"@pid":"19/5179","text":"Andreas Blass"},{"@pid":"g/YuriGurevich","text":"Yuri Gurevich"}]},"title":"Randomizing Reductions of Search Problems.","venue":"FSTTCS","pages":"10-24","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/BlassG91","doi":"10.1007/3-540-54967-6_58","ee":"https://doi.org/10.1007/3-540-54967-6_58","url":"https://dblp.org/rec/conf/fsttcs/BlassG91"}, "url":"URL#6917303" }, { "@score":"1", "@id":"6917304", "info":{"authors":{"author":{"@pid":"b/ManuelBlum","text":"Manuel Blum 0001"}},"title":"Program Checking.","venue":"FSTTCS","pages":"1-9","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/Blum91","doi":"10.1007/3-540-54967-6_57","ee":"https://doi.org/10.1007/3-540-54967-6_57","url":"https://dblp.org/rec/conf/fsttcs/Blum91"}, "url":"URL#6917304" }, { "@score":"1", "@id":"6917305", "info":{"authors":{"author":[{"@pid":"c/JohnCase","text":"John Case"},{"@pid":"j/SanjayJain1","text":"Sanjay Jain 0001"},{"@pid":"20/6874-1","text":"Arun Sharma 0001"}]},"title":"Complexity Issues for Vacillatory Function Identification.","venue":"FSTTCS","pages":"121-140","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/CaseJS91","doi":"10.1007/3-540-54967-6_65","ee":"https://doi.org/10.1007/3-540-54967-6_65","url":"https://dblp.org/rec/conf/fsttcs/CaseJS91"}, "url":"URL#6917305" }, { "@score":"1", "@id":"6917306", "info":{"authors":{"author":{"@pid":"01/5176","text":"Martin Fürer"}},"title":"Contracting Planar Graphs Efficiency in Parallel.","venue":"FSTTCS","pages":"319-335","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/Furer91","doi":"10.1007/3-540-54967-6_78","ee":"https://doi.org/10.1007/3-540-54967-6_78","url":"https://dblp.org/rec/conf/fsttcs/Furer91"}, "url":"URL#6917306" }, { "@score":"1", "@id":"6917307", "info":{"authors":{"author":[{"@pid":"g/JudyGoldsmith","text":"Judy Goldsmith"},{"@pid":"h/LaneAHemaspaandra","text":"Lane A. Hemachandra"},{"@pid":"39/2507","text":"Kenneth Kunen"}]},"title":"On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions.","venue":"FSTTCS","pages":"212-223","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/GoldsmithHK91","doi":"10.1007/3-540-54967-6_70","ee":"https://doi.org/10.1007/3-540-54967-6_70","url":"https://dblp.org/rec/conf/fsttcs/GoldsmithHK91"}, "url":"URL#6917307" }, { "@score":"1", "@id":"6917308", "info":{"authors":{"author":[{"@pid":"41/4476","text":"Subir Kumar Ghosh"},{"@pid":"m/AnilMaheshwari","text":"Anil Maheshwari"},{"@pid":"p/SudebkumarPrasantPal","text":"Sudebkumar Prasant Pal"},{"@pid":"74/4799","text":"Sanjeev Saluja"},{"@pid":"72/1489","text":"C. E. Veni Madhavan"}]},"title":"Computing the Shortest Path Tree in a Weak Visibility Polygon.","venue":"FSTTCS","pages":"369-389","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/GoshMPSM91","doi":"10.1007/3-540-54967-6_82","ee":"https://doi.org/10.1007/3-540-54967-6_82","url":"https://dblp.org/rec/conf/fsttcs/GoshMPSM91"}, "url":"URL#6917308" }, { "@score":"1", "@id":"6917309", "info":{"authors":{"author":{"@pid":"25/6675","text":"Hardi Hungar"}},"title":"Correstness of Programs over Poor Signatures.","venue":"FSTTCS","pages":"109-120","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/Hungar91","doi":"10.1007/3-540-54967-6_64","ee":"https://doi.org/10.1007/3-540-54967-6_64","url":"https://dblp.org/rec/conf/fsttcs/Hungar91"}, "url":"URL#6917309" }, { "@score":"1", "@id":"6917310", "info":{"authors":{"author":[{"@pid":"j/TaoJiang-1","text":"Tao Jiang 0001"},{"@pid":"02/3529","text":"Edward McDowell"},{"@pid":"24/3232","text":"Bala Ravikumar"}]},"title":"The Structure and Complexity of Minimal NFA's over a Unary Alphabet.","venue":"FSTTCS","pages":"152-171","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/JiangMR91","doi":"10.1007/3-540-54967-6_67","ee":"https://doi.org/10.1007/3-540-54967-6_67","url":"https://dblp.org/rec/conf/fsttcs/JiangMR91"}, "url":"URL#6917310" }, { "@score":"1", "@id":"6917311", "info":{"authors":{"author":[{"@pid":"80/5192","text":"Sam M. Kim"},{"@pid":"80/5501","text":"Robert McNaughton"}]},"title":"Computing the Order of a Locally Testable Automaton.","venue":"FSTTCS","pages":"186-211","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/KimM91","doi":"10.1007/3-540-54967-6_69","ee":"https://doi.org/10.1007/3-540-54967-6_69","url":"https://dblp.org/rec/conf/fsttcs/KimM91"}, "url":"URL#6917311" }, { "@score":"1", "@id":"6917312", "info":{"authors":{"author":[{"@pid":"k/DannyKrizanc","text":"Danny Krizanc"},{"@pid":"n/LataNarayanan","text":"Lata Narayanan"},{"@pid":"26/680","text":"Rajeev Raman"}]},"title":"Fast Deterministic Selection on Mesh-Connected Processor Arrays.","venue":"FSTTCS","pages":"336-346","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/KrizancNR91","doi":"10.1007/3-540-54967-6_79","ee":"https://doi.org/10.1007/3-540-54967-6_79","url":"https://dblp.org/rec/conf/fsttcs/KrizancNR91"}, "url":"URL#6917312" }, { "@score":"1", "@id":"6917313", "info":{"authors":{"author":[{"@pid":"l/KamalLodaya","text":"Kamal Lodaya"},{"@pid":"80/2956","text":"Ramaswamy Ramanujam"}]},"title":"Tense Logics for Local Reasoning in Distributed Systems.","venue":"FSTTCS","pages":"71-88","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/LodayaR91","doi":"10.1007/3-540-54967-6_62","ee":"https://doi.org/10.1007/3-540-54967-6_62","url":"https://dblp.org/rec/conf/fsttcs/LodayaR91"}, "url":"URL#6917313" }, { "@score":"1", "@id":"6917314", "info":{"authors":{"author":[{"@pid":"72/1636","text":"Meena Mahajan"},{"@pid":"k/KKrithivasan","text":"Kamala Krithivasan"}]},"title":"Relativised Cellular Automata and Complexity Classes.","venue":"FSTTCS","pages":"172-185","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/MahajanK91","doi":"10.1007/3-540-54967-6_68","ee":"https://doi.org/10.1007/3-540-54967-6_68","url":"https://dblp.org/rec/conf/fsttcs/MahajanK91"}, "url":"URL#6917314" }, { "@score":"1", "@id":"6917315", "info":{"authors":{"author":[{"@pid":"m/YishayMansour","text":"Yishay Mansour"},{"@pid":"58/4099","text":"James K. Park"},{"@pid":"s/BaruchSchieber","text":"Baruch Schieber"}]},"title":"Improved Selection on Totally Monotone Arrays.","venue":"FSTTCS","pages":"347-359","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/MansourPS91","doi":"10.1007/3-540-54967-6_80","ee":"https://doi.org/10.1007/3-540-54967-6_80","url":"https://dblp.org/rec/conf/fsttcs/MansourPS91"}, "url":"URL#6917315" }, { "@score":"1", "@id":"6917316", "info":{"authors":{"author":[{"@pid":"64/3670","text":"Subrata Mitra"},{"@pid":"89/2818","text":"G. Sivakumar"}]},"title":"AC-Equation Solving.","venue":"FSTTCS","pages":"40-56","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/MitraS91","doi":"10.1007/3-540-54967-6_60","ee":"https://doi.org/10.1007/3-540-54967-6_60","url":"https://dblp.org/rec/conf/fsttcs/MitraS91"}, "url":"URL#6917316" }, { "@score":"1", "@id":"6917317", "info":{"authors":{"author":[{"@pid":"m/JIanMunro","text":"J. Ian Munro"},{"@pid":"25/2134","text":"Venkatesh Raman 0001"}]},"title":"Fast Sorting In-Place Sorting with O(n) Data.","venue":"FSTTCS","pages":"266-277","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/MunroR91","doi":"10.1007/3-540-54967-6_74","ee":"https://doi.org/10.1007/3-540-54967-6_74","url":"https://dblp.org/rec/conf/fsttcs/MunroR91"}, "url":"URL#6917317" }, { "@score":"1", "@id":"6917318", "info":{"authors":{"author":[{"@pid":"70/742","text":"Inga Niepel"},{"@pid":"r/PeterRossmanith","text":"Peter Rossmanith"}]},"title":"Uniform Circuits and Exclusive Read PRAMs.","venue":"FSTTCS","pages":"307-318","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/NiepelR91","doi":"10.1007/3-540-54967-6_77","ee":"https://doi.org/10.1007/3-540-54967-6_77","url":"https://dblp.org/rec/conf/fsttcs/NiepelR91"}, "url":"URL#6917318" }, { "@score":"1", "@id":"6917319", "info":{"authors":{"author":[{"@pid":"p/CHPapadimitriou","text":"Christos H. Papadimitriou"},{"@pid":"r/PVRangan","text":"P. Venkat Rangan"},{"@pid":"66/2152","text":"Martha Sideri"}]},"title":"Designing Secure Communication Protocols from Trust Specifications.","venue":"FSTTCS","pages":"360-368","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/PapadimitriouRS91","doi":"10.1007/3-540-54967-6_81","ee":"https://doi.org/10.1007/3-540-54967-6_81","url":"https://dblp.org/rec/conf/fsttcs/PapadimitriouRS91"}, "url":"URL#6917319" }, { "@score":"1", "@id":"6917320", "info":{"authors":{"author":{"@pid":"97/3615","text":"Vangelis Th. Paschos"}},"title":"A Theorem on the Approximation of Set Cover and Vertex Cover.","venue":"FSTTCS","pages":"278-287","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/Paschos91","doi":"10.1007/3-540-54967-6_75","ee":"https://doi.org/10.1007/3-540-54967-6_75","url":"https://dblp.org/rec/conf/fsttcs/Paschos91"}, "url":"URL#6917320" }, { "@score":"1", "@id":"6917321", "info":{"authors":{"author":[{"@pid":"70/178","text":"Sachin B. Patkar"},{"@pid":"05/5131","text":"H. Narayanan"}]},"title":"A Fast Algorithm for the Principle Partition of a Graph.","venue":"FSTTCS","pages":"288-306","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/PatkarN91","doi":"10.1007/3-540-54967-6_76","ee":"https://doi.org/10.1007/3-540-54967-6_76","url":"https://dblp.org/rec/conf/fsttcs/PatkarN91"}, "url":"URL#6917321" }, { "@score":"1", "@id":"6917322", "info":{"authors":{"author":[{"@pid":"33/796","text":"Bertrand Le Saëc"},{"@pid":"95/3009","text":"Jean-Eric Pin"},{"@pid":"w/PascalWeil","text":"Pascal Weil"}]},"title":"A Purely Algebraic Proof of McNaughton's Theorem on Infinite Words.","venue":"FSTTCS","pages":"141-151","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/SaecPW91","doi":"10.1007/3-540-54967-6_66","ee":"https://doi.org/10.1007/3-540-54967-6_66","url":"https://dblp.org/rec/conf/fsttcs/SaecPW91"}, "url":"URL#6917322" }, { "@score":"1", "@id":"6917323", "info":{"authors":{"author":{"@pid":"231/0300","text":"David Sands"}},"title":"Time Analysis, Cost Equivalence and Program Refinement.","venue":"FSTTCS","pages":"25-39","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/Sands91","doi":"10.1007/3-540-54967-6_59","ee":"https://doi.org/10.1007/3-540-54967-6_59","url":"https://dblp.org/rec/conf/fsttcs/Sands91"}, "url":"URL#6917323" }, { "@score":"1", "@id":"6917324", "info":{"authors":{"author":{"@pid":"s/IainAStewart","text":"Iain A. Stewart"}},"title":"Complete Problems Involving Boolean Labelled Structures and Projections Translations.","venue":"FSTTCS","pages":"242-260","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/Stewart91","doi":"10.1007/3-540-54967-6_72","ee":"https://doi.org/10.1007/3-540-54967-6_72","url":"https://dblp.org/rec/conf/fsttcs/Stewart91"}, "url":"URL#6917324" }, { "@score":"1", "@id":"6917325", "info":{"authors":{"author":[{"@pid":"05/1786","text":"Qing-Ping Tan"},{"@pid":"48/2726","text":"Huo-Wang Chen"}]},"title":"On the Operational Interpretation of Complex Types.","venue":"FSTTCS","pages":"57-70","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/TanC91","doi":"10.1007/3-540-54967-6_61","ee":"https://doi.org/10.1007/3-540-54967-6_61","url":"https://dblp.org/rec/conf/fsttcs/TanC91"}, "url":"URL#6917325" }, { "@score":"1", "@id":"6917326", "info":{"authors":{"author":{"@pid":"77/257","text":"V. Vinay"}},"title":"Is BP.+P a Probabilistic Class?","venue":"FSTTCS","pages":"261-265","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/Vinay91","doi":"10.1007/3-540-54967-6_73","ee":"https://doi.org/10.1007/3-540-54967-6_73","url":"https://dblp.org/rec/conf/fsttcs/Vinay91"}, "url":"URL#6917326" }, { "@score":"1", "@id":"6917327", "info":{"authors":{"author":{"@pid":"w/GlynnWinskel","text":"Glynn Winskel"}},"title":"Petri Nets and Transition Systems (Abstract for an invited talk).","venue":"FSTTCS","pages":"420","year":"1991","type":"Conference and Workshop Papers","access":"closed","key":"conf/fsttcs/Winskel91","doi":"10.1007/3-540-54967-6_84","ee":"https://doi.org/10.1007/3-540-54967-6_84","url":"https://dblp.org/rec/conf/fsttcs/Winskel91"}, "url":"URL#6917327" }, { "@score":"1", "@id":"6927989", "info":{"authors":{"author":[{"@pid":"b/SomenathBiswas","text":"Somenath Biswas"},{"@pid":"08/11295","text":"Kesav V. Nori"}]},"title":"Foundations of Software Technology and Theoretical Computer Science, 11th Conference, New Delhi, India, December 17-19, 1991, Proceedings","venue":["FSTTCS","Lecture Notes in Computer Science"],"volume":"560","publisher":"Springer","year":"1991","type":"Editorship","key":"conf/fsttcs/1991","doi":"10.1007/3-540-54967-6","ee":"https://doi.org/10.1007/3-540-54967-6","url":"https://dblp.org/rec/conf/fsttcs/1991"}, "url":"URL#6927989" } ] } } } )