callback( { "result":{ "query":":facetid:toc:\"db/journals/ipl/ipl39.bht\"", "status":{ "@code":"200", "text":"OK" }, "time":{ "@unit":"msecs", "text":"218.75" }, "completions":{ "@total":"1", "@computed":"1", "@sent":"1", "c":{ "@sc":"56", "@dc":"56", "@oc":"56", "@id":"43449489", "text":":facetid:toc:db/journals/ipl/ipl39.bht" } }, "hits":{ "@total":"56", "@computed":"56", "@sent":"56", "@first":"0", "hit":[{ "@score":"1", "@id":"6902199", "info":{"authors":{"author":[{"@pid":"a/AlbertoApostolico","text":"Alberto Apostolico"},{"@pid":"f/MartinFarachColton","text":"Martin Farach"},{"@pid":"i/CSIliopoulos","text":"Costas S. Iliopoulos"}]},"title":"Optimal Superprimitivity Testing for Strings.","venue":"Inf. Process. Lett.","volume":"39","number":"1","pages":"17-20","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/ApostolicoFI91","doi":"10.1016/0020-0190(91)90056-N","ee":"https://doi.org/10.1016/0020-0190(91)90056-N","url":"https://dblp.org/rec/journals/ipl/ApostolicoFI91"}, "url":"URL#6902199" }, { "@score":"1", "@id":"6902200", "info":{"authors":{"author":{"@pid":"b/RABaezaYates","text":"Ricardo A. Baeza-Yates"}},"title":"Height Balance Distribution of Search Trees.","venue":"Inf. Process. Lett.","volume":"39","number":"6","pages":"317-324","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Baeza-Yates91","doi":"10.1016/0020-0190(91)90005-3","ee":"https://doi.org/10.1016/0020-0190(91)90005-3","url":"https://dblp.org/rec/journals/ipl/Baeza-Yates91"}, "url":"URL#6902200" }, { "@score":"1", "@id":"6902201", "info":{"authors":{"author":{"@pid":"b/DominiqueRoelantsvanBaronaigien","text":"Dominique Roelants van Baronaigien"}},"title":"A Loopless Algorithm for Generating Binary Tree Sequences.","venue":"Inf. Process. Lett.","volume":"39","number":"4","pages":"189-194","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Baronaigien91","doi":"10.1016/0020-0190(91)90178-K","ee":"https://doi.org/10.1016/0020-0190(91)90178-K","url":"https://dblp.org/rec/journals/ipl/Baronaigien91"}, "url":"URL#6902201" }, { "@score":"1", "@id":"6902205", "info":{"authors":{"author":[{"@pid":"05/6905","text":"Abdulla Bataineh"},{"@pid":"88/759","text":"Füsun Özgüner"},{"@pid":"69/342","text":"Alok Sarwal"}]},"title":"Parallel Boolean Operations for Information Retrieval.","venue":"Inf. Process. Lett.","volume":"39","number":"2","pages":"99-108","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/BatainehOS91","doi":"10.1016/0020-0190(91)90162-B","ee":"https://doi.org/10.1016/0020-0190(91)90162-B","url":"https://dblp.org/rec/journals/ipl/BatainehOS91"}, "url":"URL#6902205" }, { "@score":"1", "@id":"6902208", "info":{"authors":{"author":{"@pid":"27/4104","text":"A. Bijlsma 0001"}},"title":"Derivation of Logic Programs by Functional Methods.","venue":"Inf. Process. Lett.","volume":"39","number":"6","pages":"325-332","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Bijlsma91","doi":"10.1016/0020-0190(91)90006-4","ee":"https://doi.org/10.1016/0020-0190(91)90006-4","url":"https://dblp.org/rec/journals/ipl/Bijlsma91"}, "url":"URL#6902208" }, { "@score":"1", "@id":"6902211", "info":{"authors":{"author":{"@pid":"58/2261","text":"Ronald V. Book"}},"title":"On Random Oracle Separations.","venue":"Inf. Process. Lett.","volume":"39","number":"1","pages":"7-10","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Book91","doi":"10.1016/0020-0190(91)90054-L","ee":"https://doi.org/10.1016/0020-0190(91)90054-L","url":"https://dblp.org/rec/journals/ipl/Book91"}, "url":"URL#6902211" }, { "@score":"1", "@id":"6902216", "info":{"authors":{"author":[{"@pid":"20/3028","text":"Coenraad Bron"},{"@pid":"h/WimHHesselink","text":"Wim H. Hesselink"}]},"title":"Smoothsort Revisited.","venue":"Inf. Process. Lett.","volume":"39","number":"5","pages":"269-276","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/BronH91","doi":"10.1016/0020-0190(91)90027-F","ee":"https://doi.org/10.1016/0020-0190(91)90027-F","url":"https://dblp.org/rec/journals/ipl/BronH91"}, "url":"URL#6902216" }, { "@score":"1", "@id":"6902220", "info":{"authors":{"author":[{"@pid":"07/952","text":"Svante Carlsson"},{"@pid":"79/450","text":"Jingsen Chen"}]},"title":"An Optimal Parallel Adaptive Sorting Algorithm.","venue":"Inf. Process. Lett.","volume":"39","number":"4","pages":"195-200","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/CarlssonC91","doi":"10.1016/0020-0190(91)90179-L","ee":"https://doi.org/10.1016/0020-0190(91)90179-L","url":"https://dblp.org/rec/journals/ipl/CarlssonC91"}, "url":"URL#6902220" }, { "@score":"1", "@id":"6902224", "info":{"authors":{"author":{"@pid":"50/2598","text":"Bernadette Charron-Bost"}},"title":"Concerning the Size of Logical Clocks in Distributed Systems.","venue":"Inf. Process. Lett.","volume":"39","number":"1","pages":"11-16","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Charron-Bost91","doi":"10.1016/0020-0190(91)90055-M","ee":"https://doi.org/10.1016/0020-0190(91)90055-M","url":"https://dblp.org/rec/journals/ipl/Charron-Bost91"}, "url":"URL#6902224" }, { "@score":"1", "@id":"6902226", "info":{"authors":{"author":{"@pid":"c/JianerChen","text":"Jianer Chen"}},"title":"Characterizing Parallel Hierarchies by Reducibilities.","venue":"Inf. Process. Lett.","volume":"39","number":"6","pages":"303-307","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Chen91","doi":"10.1016/0020-0190(91)90003-Z","ee":"https://doi.org/10.1016/0020-0190(91)90003-Z","url":"https://dblp.org/rec/journals/ipl/Chen91"}, "url":"URL#6902226" }, { "@score":"1", "@id":"6902228", "info":{"authors":{"author":[{"@pid":"c/JianerChen","text":"Jianer Chen"},{"@pid":"57/2596","text":"Jim Cox"},{"@pid":"m/BhubaneswarMishra","text":"Bud Mishra"}]},"title":"An NL Hierarchy.","venue":"Inf. Process. Lett.","volume":"39","number":"1","pages":"21-26","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/ChenCM91","doi":"10.1016/0020-0190(91)90057-O","ee":"https://doi.org/10.1016/0020-0190(91)90057-O","url":"https://dblp.org/rec/journals/ipl/ChenCM91"}, "url":"URL#6902228" }, { "@score":"1", "@id":"6902231", "info":{"authors":{"author":[{"@pid":"55/2698","text":"Nian-Shing Chen"},{"@pid":"18/680","text":"Hwey-Pyng Yu"},{"@pid":"34/3420","text":"Shing-Tsaan Huang"}]},"title":"A Self-Stabilizing Algorithm for Constructing Spanning Trees.","venue":"Inf. Process. Lett.","volume":"39","number":"3","pages":"147-151","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/ChenYH91","doi":"10.1016/0020-0190(91)90111-T","ee":"https://doi.org/10.1016/0020-0190(91)90111-T","url":"https://dblp.org/rec/journals/ipl/ChenYH91"}, "url":"URL#6902231" }, { "@score":"1", "@id":"6902238", "info":{"authors":{"author":{"@pid":"27/964","text":"Davide Crippa"}},"title":"A Special Case of the Dynamization Problem for Least Cost Paths.","venue":"Inf. Process. Lett.","volume":"39","number":"6","pages":"297-302","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Crippa91","doi":"10.1016/0020-0190(91)90002-Y","ee":"https://doi.org/10.1016/0020-0190(91)90002-Y","url":"https://dblp.org/rec/journals/ipl/Crippa91"}, "url":"URL#6902238" }, { "@score":"1", "@id":"6902251", "info":{"authors":{"author":[{"@pid":"f/AlessandroFantechi","text":"Alessandro Fantechi"},{"@pid":"g/StefaniaGnesi","text":"Stefania Gnesi"}]},"title":"Compositionality and Bisimulation: A Negative Result.","venue":"Inf. Process. Lett.","volume":"39","number":"2","pages":"109-114","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/FantechiG91","doi":"10.1016/0020-0190(91)90163-C","ee":"https://doi.org/10.1016/0020-0190(91)90163-C","url":"https://dblp.org/rec/journals/ipl/FantechiG91"}, "url":"URL#6902251" }, { "@score":"1", "@id":"6902255", "info":{"authors":{"author":[{"@pid":"74/3005","text":"Pierre Fraigniaud"},{"@pid":"30/5292","text":"Claudine Peyrat"}]},"title":"Broadcasting in a Hypercube when Some Calls Fail.","venue":"Inf. Process. Lett.","volume":"39","number":"3","pages":"115-119","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/FraigniaudP91","doi":"10.1016/0020-0190(91)90105-Q","ee":"https://doi.org/10.1016/0020-0190(91)90105-Q","url":"https://dblp.org/rec/journals/ipl/FraigniaudP91"}, "url":"URL#6902255" }, { "@score":"1", "@id":"6902257", "info":{"authors":{"author":[{"@pid":"44/5430","text":"M. L. Garg"},{"@pid":"00/11194","text":"Syed I. Ahson"},{"@pid":"59/5596","text":"P. V. Gupta"}]},"title":"A Fuzzy Petri Net for Knowledge Representation and Reasoning.","venue":"Inf. Process. Lett.","volume":"39","number":"3","pages":"165-171","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/GargAG91","doi":"10.1016/0020-0190(91)90114-W","ee":"https://doi.org/10.1016/0020-0190(91)90114-W","url":"https://dblp.org/rec/journals/ipl/GargAG91"}, "url":"URL#6902257" }, { "@score":"1", "@id":"6902266", "info":{"authors":{"author":{"@pid":"g/RobertoGrossi","text":"Roberto Grossi"}},"title":"A Note on the Subtree Isomorphism for Ordered Trees and Related Problems.","venue":"Inf. Process. Lett.","volume":"39","number":"2","pages":"81-84","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Grossi91","doi":"10.1016/0020-0190(91)90159-F","ee":"https://doi.org/10.1016/0020-0190(91)90159-F","url":"https://dblp.org/rec/journals/ipl/Grossi91"}, "url":"URL#6902266" }, { "@score":"1", "@id":"6902274", "info":{"authors":{"author":{"@pid":"89/1766","text":"Paul J. Heffernan"}},"title":"The Translation Square Map and Approximate Congruence.","venue":"Inf. Process. Lett.","volume":"39","number":"3","pages":"153-159","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Heffernan91","doi":"10.1016/0020-0190(91)90112-U","ee":"https://doi.org/10.1016/0020-0190(91)90112-U","url":"https://dblp.org/rec/journals/ipl/Heffernan91"}, "url":"URL#6902274" }, { "@score":"1", "@id":"6902278", "info":{"authors":{"author":[{"@pid":"h/ThomasHofmeister","text":"Thomas Hofmeister"},{"@pid":"11/6946","text":"Walter Hohberg"},{"@pid":"48/5124","text":"Susanne Köhling"}]},"title":"Some Notes on Threshold Circuits, and Multiplication in Depth 4.","venue":"Inf. Process. Lett.","volume":"39","number":"4","pages":"219-225","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/HofmeisterHK91","doi":"10.1016/0020-0190(91)90183-I","ee":"https://doi.org/10.1016/0020-0190(91)90183-I","url":"https://dblp.org/rec/journals/ipl/HofmeisterHK91"}, "url":"URL#6902278" }, { "@score":"1", "@id":"6902281", "info":{"authors":{"author":{"@pid":"04/5796","text":"Rodney R. Howell"}},"title":"The Complexity of Problems Involving Structurally Bounded and Conservative Petri Nets.","venue":"Inf. Process. Lett.","volume":"39","number":"6","pages":"309-315","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Howell91","doi":"10.1016/0020-0190(91)90004-2","ee":"https://doi.org/10.1016/0020-0190(91)90004-2","url":"https://dblp.org/rec/journals/ipl/Howell91"}, "url":"URL#6902281" }, { "@score":"1", "@id":"6902283", "info":{"authors":{"author":[{"@pid":"22/1324","text":"Lih-Hsing Hsu"},{"@pid":"74/1072","text":"Rong-Hong Jan"},{"@pid":"93/6452","text":"Yu-Che Lee"},{"@pid":"02/2729","text":"Chun-Nan Hung"},{"@pid":"39/310","text":"Maw-Sheng Chern"}]},"title":"Finding the Most Vital Edge with Respect to Minimum Spanning Tree in Weighted Graphs.","venue":"Inf. Process. Lett.","volume":"39","number":"5","pages":"277-281","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/HsuJLHC91","doi":"10.1016/0020-0190(91)90028-G","ee":"https://doi.org/10.1016/0020-0190(91)90028-G","url":"https://dblp.org/rec/journals/ipl/HsuJLHC91"}, "url":"URL#6902283" }, { "@score":"1", "@id":"6902286", "info":{"authors":{"author":[{"@pid":"96/5070","text":"Bing-Chao Huang"},{"@pid":"l/MALangston","text":"Michael A. Langston"}]},"title":"Stable Set and Multiset Operations in Optimal Time and Space.","venue":"Inf. Process. Lett.","volume":"39","number":"3","pages":"131-136","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/HuangL91","doi":"10.1016/0020-0190(91)90108-T","ee":"https://doi.org/10.1016/0020-0190(91)90108-T","url":"https://dblp.org/rec/journals/ipl/HuangL91"}, "url":"URL#6902286" }, { "@score":"1", "@id":"6902290", "info":{"authors":{"author":[{"@pid":"i/SandyIrani","text":"Sandy Irani"},{"@pid":"r/RonittRubinfeld","text":"Ronitt Rubinfeld"}]},"title":"A Competitive 2-Server Algorithm.","venue":"Inf. Process. Lett.","volume":"39","number":"2","pages":"85-91","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/IraniR91","doi":"10.1016/0020-0190(91)90160-J","ee":"https://doi.org/10.1016/0020-0190(91)90160-J","url":"https://dblp.org/rec/journals/ipl/IraniR91"}, "url":"URL#6902290" }, { "@score":"1", "@id":"6902296", "info":{"authors":{"author":{"@pid":"64/3060","text":"Janice Jeffs"}},"title":"Order Independent NCE Grammars Recognized in Polynomial Time.","venue":"Inf. Process. Lett.","volume":"39","number":"3","pages":"161-164","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Jeffs91","doi":"10.1016/0020-0190(91)90113-V","ee":"https://doi.org/10.1016/0020-0190(91)90113-V","url":"https://dblp.org/rec/journals/ipl/Jeffs91"}, "url":"URL#6902296" }, { "@score":"1", "@id":"6902304", "info":{"authors":{"author":[{"@pid":"31/5708","text":"Dimitris Kavadias"},{"@pid":"17/3093","text":"Lefteris M. Kirousis"},{"@pid":"s/PaulGSpirakis","text":"Paul G. Spirakis"}]},"title":"The Complexity of the Reliable Connectivity Problem.","venue":"Inf. Process. Lett.","volume":"39","number":"5","pages":"245-252","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/KavadiasKS91","doi":"10.1016/0020-0190(91)90023-B","ee":"https://doi.org/10.1016/0020-0190(91)90023-B","url":"https://dblp.org/rec/journals/ipl/KavadiasKS91"}, "url":"URL#6902304" }, { "@score":"1", "@id":"6902305", "info":{"authors":{"author":{"@pid":"k/JMarkKeil","text":"J. Mark Keil"}},"title":"A Simple Algorithm for Determining the Envelope of a Set of Lines.","venue":"Inf. Process. Lett.","volume":"39","number":"3","pages":"121-124","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Keil91","doi":"10.1016/0020-0190(91)90106-R","ee":"https://doi.org/10.1016/0020-0190(91)90106-R","url":"https://dblp.org/rec/journals/ipl/Keil91"}, "url":"URL#6902305" }, { "@score":"1", "@id":"6902315", "info":{"authors":{"author":[{"@pid":"55/673","text":"Christos Levcopoulos"},{"@pid":"28/496","text":"Ola Petersson"}]},"title":"Splitsort - An Adaptive Sorting Algorithm.","venue":"Inf. Process. Lett.","volume":"39","number":"4","pages":"205-211","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/LevcopoulosP91","doi":"10.1016/0020-0190(91)90181-G","ee":"https://doi.org/10.1016/0020-0190(91)90181-G","url":"https://dblp.org/rec/journals/ipl/LevcopoulosP91"}, "url":"URL#6902315" }, { "@score":"1", "@id":"6902320", "info":{"authors":{"author":[{"@pid":"88/2656","text":"Fabrizio Luccio"},{"@pid":"p/LindaPagli","text":"Linda Pagli"}]},"title":"An Efficient Algorithm for Some Tree Matching Problems.","venue":"Inf. Process. Lett.","volume":"39","number":"1","pages":"51-57","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/LuccioP91","doi":"10.1016/0020-0190(91)90062-M","ee":"https://doi.org/10.1016/0020-0190(91)90062-M","url":"https://dblp.org/rec/journals/ipl/LuccioP91"}, "url":"URL#6902320" }, { "@score":"1", "@id":"6902331", "info":{"authors":{"author":{"@pid":"m/JiriMatousek","text":"Jirí Matousek 0001"}},"title":"Randomized Optimal Algorithm for Slope Selection","venue":"Inf. Process. Lett.","volume":"39","number":"4","pages":"183-187","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Matousek91a","doi":"10.1016/0020-0190(91)90177-J","ee":"https://doi.org/10.1016/0020-0190(91)90177-J","url":"https://dblp.org/rec/journals/ipl/Matousek91a"}, "url":"URL#6902331" }, { "@score":"1", "@id":"6902338", "info":{"authors":{"author":[{"@pid":"40/2480","text":"Robert J. T. Morris"},{"@pid":"63/956","text":"Wing Shing Wong"}]},"title":"Systematic Choice of Initial Points in Local Search: Extensions and Application to Neural Networks.","venue":"Inf. Process. Lett.","volume":"39","number":"4","pages":"213-217","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/MorrisW91","doi":"10.1016/0020-0190(91)90182-H","ee":"https://doi.org/10.1016/0020-0190(91)90182-H","url":"https://dblp.org/rec/journals/ipl/MorrisW91"}, "url":"URL#6902338" }, { "@score":"1", "@id":"6902339", "info":{"authors":{"author":{"@pid":"93/983","text":"Tatsuya Motoki"}},"title":"Inductive Inference from all Positive and Some Negative Data.","venue":"Inf. Process. Lett.","volume":"39","number":"4","pages":"177-182","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Motoki91","doi":"10.1016/0020-0190(91)90176-I","ee":"https://doi.org/10.1016/0020-0190(91)90176-I","url":"https://dblp.org/rec/journals/ipl/Motoki91"}, "url":"URL#6902339" }, { "@score":"1", "@id":"6902341", "info":{"authors":{"author":{"@pid":"m/JeanFredericMyoupo","text":"Jean Frédéric Myoupo"}},"title":"Dynamic Programming on Linear Pipelines.","venue":"Inf. Process. Lett.","volume":"39","number":"6","pages":"333-341","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Myoupo91","doi":"10.1016/0020-0190(91)90007-5","ee":"https://doi.org/10.1016/0020-0190(91)90007-5","url":"https://dblp.org/rec/journals/ipl/Myoupo91"}, "url":"URL#6902341" }, { "@score":"1", "@id":"6902343", "info":{"authors":{"author":{"@pid":"n/IlanNewman","text":"Ilan Newman"}},"title":"Private vs. Common Random Bits in Communication Complexity.","venue":"Inf. Process. Lett.","volume":"39","number":"2","pages":"67-71","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Newman91","doi":"10.1016/0020-0190(91)90157-D","ee":"https://doi.org/10.1016/0020-0190(91)90157-D","url":"https://dblp.org/rec/journals/ipl/Newman91"}, "url":"URL#6902343" }, { "@score":"1", "@id":"6902344", "info":{"authors":{"author":[{"@pid":"n/RobertNieuwenhuis","text":"Robert Nieuwenhuis"},{"@pid":"10/6162","text":"Pilar Nivela"}]},"title":"Efficient Deduction in Equality Horn Logic by Horn-Completion.","venue":"Inf. Process. Lett.","volume":"39","number":"1","pages":"1-6","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/NieuwenhuisN91","doi":"10.1016/0020-0190(91)90053-K","ee":"https://doi.org/10.1016/0020-0190(91)90053-K","url":"https://dblp.org/rec/journals/ipl/NieuwenhuisN91"}, "url":"URL#6902344" }, { "@score":"1", "@id":"6902346", "info":{"authors":{"author":[{"@pid":"90/1985","text":"Ronald A. Olsson"},{"@pid":"62/3348","text":"Daniel T. Huang"}]},"title":"Axiomatic Semantics for "Escape" Statements.","venue":"Inf. Process. Lett.","volume":"39","number":"1","pages":"27-33","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/OlssonH91","doi":"10.1016/0020-0190(91)90058-P","ee":"https://doi.org/10.1016/0020-0190(91)90058-P","url":"https://dblp.org/rec/journals/ipl/OlssonH91"}, "url":"URL#6902346" }, { "@score":"1", "@id":"6902347", "info":{"authors":{"author":{"@pid":"44/3382","text":"Amos Omondi"}},"title":"Fast One's-Complement Multiplication.","venue":"Inf. Process. Lett.","volume":"39","number":"2","pages":"73-79","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Omondi91","doi":"10.1016/0020-0190(91)90158-E","ee":"https://doi.org/10.1016/0020-0190(91)90158-E","url":"https://dblp.org/rec/journals/ipl/Omondi91"}, "url":"URL#6902347" }, { "@score":"1", "@id":"6902349", "info":{"authors":{"author":{"@pid":"67/4067","text":"Abhay K. Parekh"}},"title":"Analysis of a Greedy Heuristic for Finding Small Dominating Sets in Graphs.","venue":"Inf. Process. Lett.","volume":"39","number":"5","pages":"237-240","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Parekh91","doi":"10.1016/0020-0190(91)90021-9","ee":"https://doi.org/10.1016/0020-0190(91)90021-9","url":"https://dblp.org/rec/journals/ipl/Parekh91"}, "url":"URL#6902349" }, { "@score":"1", "@id":"6902356", "info":{"authors":{"author":[{"@pid":"30/3009-1","text":"Ke Qiu 0001"},{"@pid":"60/3098","text":"Henk Meijer"},{"@pid":"a/SGAkl","text":"Selim G. Akl"}]},"title":"Decomposing a Star Graph Into Disjoint Cycles.","venue":"Inf. Process. Lett.","volume":"39","number":"3","pages":"125-129","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/QiuMA91","doi":"10.1016/0020-0190(91)90107-S","ee":"https://doi.org/10.1016/0020-0190(91)90107-S","url":"https://dblp.org/rec/journals/ipl/QiuMA91"}, "url":"URL#6902356" }, { "@score":"1", "@id":"6902357", "info":{"authors":{"author":{"@pid":"12/3497","text":"Prabhakar Ragde"}},"title":"Analysis of an Asynchronous PRAM Algorithm.","venue":"Inf. Process. Lett.","volume":"39","number":"5","pages":"253-256","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Ragde91","doi":"10.1016/0020-0190(91)90024-C","ee":"https://doi.org/10.1016/0020-0190(91)90024-C","url":"https://dblp.org/rec/journals/ipl/Ragde91"}, "url":"URL#6902357" }, { "@score":"1", "@id":"6902358", "info":{"authors":{"author":[{"@pid":"12/3497","text":"Prabhakar Ragde"},{"@pid":"w/AviWigderson","text":"Avi Wigderson"}]},"title":"Linear-Size Constant-Depth Polylog-Treshold Circuits.","venue":"Inf. Process. Lett.","volume":"39","number":"3","pages":"143-146","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/RagdeW91","doi":"10.1016/0020-0190(91)90110-4","ee":"https://doi.org/10.1016/0020-0190(91)90110-4","url":"https://dblp.org/rec/journals/ipl/RagdeW91"}, "url":"URL#6902358" }, { "@score":"1", "@id":"6902360", "info":{"authors":{"author":[{"@pid":"16/2155","text":"D. Sreenivasa Rao"},{"@pid":"75/6603","text":"John D. Provence"}]},"title":"An Integrated Approach to Routing and Via Minimization.","venue":"Inf. Process. Lett.","volume":"39","number":"5","pages":"257-263","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/RaoP91","doi":"10.1016/0020-0190(91)90025-D","ee":"https://doi.org/10.1016/0020-0190(91)90025-D","url":"https://dblp.org/rec/journals/ipl/RaoP91"}, "url":"URL#6902360" }, { "@score":"1", "@id":"6902362", "info":{"authors":{"author":[{"@pid":"r/MichelRaynal","text":"Michel Raynal"},{"@pid":"s/AndreSchiper","text":"André Schiper"},{"@pid":"t/SamToueg","text":"Sam Toueg"}]},"title":"The Causal Ordering Abstraction and a Simple Way to Implement it.","venue":"Inf. Process. Lett.","volume":"39","number":"6","pages":"343-350","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/RaynalST91","doi":"10.1016/0020-0190(91)90008-6","ee":"https://doi.org/10.1016/0020-0190(91)90008-6","url":"https://dblp.org/rec/journals/ipl/RaynalST91"}, "url":"URL#6902362" }, { "@score":"1", "@id":"6902371", "info":{"authors":{"author":{"@pid":"s/AchimSchweikard","text":"Achim Schweikard"}},"title":"Trigonometric Polynomials with Simple Roots.","venue":"Inf. Process. Lett.","volume":"39","number":"5","pages":"231-236","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Schweikard91","doi":"10.1016/0020-0190(91)90020-I","ee":"https://doi.org/10.1016/0020-0190(91)90020-I","url":"https://dblp.org/rec/journals/ipl/Schweikard91"}, "url":"URL#6902371" }, { "@score":"1", "@id":"6902372", "info":{"authors":{"author":{"@pid":"s/SandeepSen","text":"Sandeep Sen"}},"title":"Some Observations on Skip-Lists.","venue":"Inf. Process. Lett.","volume":"39","number":"4","pages":"173-176","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Sen91","doi":"10.1016/0020-0190(91)90175-H","ee":"https://doi.org/10.1016/0020-0190(91)90175-H","url":"https://dblp.org/rec/journals/ipl/Sen91"}, "url":"URL#6902372" }, { "@score":"1", "@id":"6902376", "info":{"authors":{"author":{"@pid":"63/6304","text":"Jang-Ping Sheu"}},"title":"Fault-Tolerant Parallel k Selection Algorithm in n-Cube Networks.","venue":"Inf. Process. Lett.","volume":"39","number":"2","pages":"93-97","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Sheu91","doi":"10.1016/0020-0190(91)90161-A","ee":"https://doi.org/10.1016/0020-0190(91)90161-A","url":"https://dblp.org/rec/journals/ipl/Sheu91"}, "url":"URL#6902376" }, { "@score":"1", "@id":"6902379", "info":{"authors":{"author":{"@pid":"s/AlexanderAShvartsman","text":"Alexander A. Shvartsman"}},"title":"Achieving Optimal CRCW PRAM Fault-Tolerance.","venue":"Inf. Process. Lett.","volume":"39","number":"2","pages":"59-66","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Shvartsman91","doi":"10.1016/0020-0190(91)90156-C","ee":"https://doi.org/10.1016/0020-0190(91)90156-C","url":"https://dblp.org/rec/journals/ipl/Shvartsman91"}, "url":"URL#6902379" }, { "@score":"1", "@id":"6902381", "info":{"authors":{"author":{"@pid":"54/4749","text":"Hans Ulrich Simon"}},"title":"The Vapnik-Chervonenkis Dimension of Decision Trees with Bounded Rank.","venue":"Inf. Process. Lett.","volume":"39","number":"3","pages":"137-141","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Simon91","doi":"10.1016/0020-0190(91)90109-U","ee":"https://doi.org/10.1016/0020-0190(91)90109-U","url":"https://dblp.org/rec/journals/ipl/Simon91"}, "url":"URL#6902381" }, { "@score":"1", "@id":"6902382", "info":{"authors":{"author":{"@pid":"s/APrasadSistla","text":"A. Prasad Sistla"}},"title":"Proving Correctness with Respect to Nondeterministic Safety Specifications.","venue":"Inf. Process. Lett.","volume":"39","number":"1","pages":"45-49","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Sistla91","doi":"10.1016/0020-0190(91)90061-L","ee":"https://doi.org/10.1016/0020-0190(91)90061-L","url":"https://dblp.org/rec/journals/ipl/Sistla91"}, "url":"URL#6902382" }, { "@score":"1", "@id":"6902384", "info":{"authors":{"author":{"@pid":"88/6446","text":"Jan L. A. van de Snepscheut"}},"title":"Inversion of a Recursive Tree Traversal.","venue":"Inf. Process. Lett.","volume":"39","number":"5","pages":"265-267","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Snepscheut91","doi":"10.1016/0020-0190(91)90026-E","ee":"https://doi.org/10.1016/0020-0190(91)90026-E","url":"https://dblp.org/rec/journals/ipl/Snepscheut91"}, "url":"URL#6902384" }, { "@score":"1", "@id":"6902387", "info":{"authors":{"author":{"@pid":"s/JeremySpinrad","text":"Jeremy P. Spinrad"}},"title":"Finding Large Holes.","venue":"Inf. Process. Lett.","volume":"39","number":"4","pages":"227-229","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Spinrad91","doi":"10.1016/0020-0190(91)90184-J","ee":"https://doi.org/10.1016/0020-0190(91)90184-J","url":"https://dblp.org/rec/journals/ipl/Spinrad91"}, "url":"URL#6902387" }, { "@score":"1", "@id":"6902389", "info":{"authors":{"author":{"@pid":"95/4774","text":"Bernhard von Stengel"}},"title":"An Algebraic Characterization of Semantic Independence.","venue":"Inf. Process. Lett.","volume":"39","number":"6","pages":"291-296","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Stengel91","doi":"10.1016/0020-0190(91)90001-X","ee":"https://doi.org/10.1016/0020-0190(91)90001-X","url":"https://dblp.org/rec/journals/ipl/Stengel91"}, "url":"URL#6902389" }, { "@score":"1", "@id":"6902391", "info":{"authors":{"author":{"@pid":"65/1772","text":"Elena Stöhr"}},"title":"Broadcasting in the Butterfly Network.","venue":"Inf. Process. Lett.","volume":"39","number":"1","pages":"41-43","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Stohr91","doi":"10.1016/0020-0190(91)90060-U","ee":"https://doi.org/10.1016/0020-0190(91)90060-U","url":"https://dblp.org/rec/journals/ipl/Stohr91"}, "url":"URL#6902391" }, { "@score":"1", "@id":"6902395", "info":{"authors":{"author":[{"@pid":"t/RobertoTamassia","text":"Roberto Tamassia"},{"@pid":"55/5488","text":"Ioannis G. Tollis"},{"@pid":"v/JeffreyScottVitter","text":"Jeffrey Scott Vitter"}]},"title":"Lower Bounds for Planar Orthogonal Drawings of Graphs.","venue":"Inf. Process. Lett.","volume":"39","number":"1","pages":"35-40","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/TamassiaTV91","doi":"10.1016/0020-0190(91)90059-Q","ee":"https://doi.org/10.1016/0020-0190(91)90059-Q","url":"https://dblp.org/rec/journals/ipl/TamassiaTV91"}, "url":"URL#6902395" }, { "@score":"1", "@id":"6902401", "info":{"authors":{"author":[{"@pid":"19/5163","text":"Maurizio Tucci"},{"@pid":"c/GennaroCostagliola","text":"Gennaro Costagliola"},{"@pid":"c/ShiKuoChang","text":"Shi-Kuo Chang"}]},"title":"A Remark on NP-Completeness of Picture Matching.","venue":"Inf. Process. Lett.","volume":"39","number":"5","pages":"241-243","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/TucciCC91","doi":"10.1016/0020-0190(91)90022-A","ee":"https://doi.org/10.1016/0020-0190(91)90022-A","url":"https://dblp.org/rec/journals/ipl/TucciCC91"}, "url":"URL#6902401" }, { "@score":"1", "@id":"6902402", "info":{"authors":{"author":{"@pid":"79/156","text":"Volker Turau"}},"title":"Fixed-Radius Near Neighbors Search.","venue":"Inf. Process. Lett.","volume":"39","number":"4","pages":"201-203","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/Turau91","doi":"10.1016/0020-0190(91)90180-P","ee":"https://doi.org/10.1016/0020-0190(91)90180-P","url":"https://dblp.org/rec/journals/ipl/Turau91"}, "url":"URL#6902402" }, { "@score":"1", "@id":"6902415", "info":{"authors":{"author":[{"@pid":"01/3409","text":"Jae Dong Yang"},{"@pid":"l/YoonJoonLee","text":"Yoon-Joon Lee"}]},"title":"A Sound and Complete Query Evaluation for Implicit Predicate which is a Semantic Descriptor of Unknown Values.","venue":"Inf. Process. Lett.","volume":"39","number":"5","pages":"283-289","year":"1991","type":"Journal Articles","access":"closed","key":"journals/ipl/YangL91","doi":"10.1016/0020-0190(91)90029-H","ee":"https://doi.org/10.1016/0020-0190(91)90029-H","url":"https://dblp.org/rec/journals/ipl/YangL91"}, "url":"URL#6902415" } ] } } } )