callback( { "result":{ "query":":facetid:toc:\"db/journals/njc/njc3.bht\"", "status":{ "@code":"200", "text":"OK" }, "time":{ "@unit":"msecs", "text":"71.34" }, "completions":{ "@total":"1", "@computed":"1", "@sent":"1", "c":{ "@sc":"25", "@dc":"25", "@oc":"25", "@id":"43464068", "text":":facetid:toc:db/journals/njc/njc3.bht" } }, "hits":{ "@total":"25", "@computed":"25", "@sent":"25", "@first":"0", "hit":[{ "@score":"1", "@id":"6690538", "info":{"authors":{"author":[{"@pid":"a/SGAkl","text":"Selim G. Akl"},{"@pid":"s/IvanStojmenovic","text":"Ivan Stojmenovic"}]},"title":"Generating t-ary Trees in Parallel.","venue":"Nord. J. Comput.","volume":"3","number":"1","pages":"63-71","year":"1996","type":"Journal Articles","access":"unavailable","key":"journals/njc/AklS96","url":"https://dblp.org/rec/journals/njc/AklS96"}, "url":"URL#6690538" }, { "@score":"1", "@id":"6690539", "info":{"authors":{"author":[{"@pid":"a/NAlon","text":"Noga Alon"},{"@pid":"88/3203","text":"Pierre Kelsen"},{"@pid":"24/507","text":"Sanjeev Mahajan"},{"@pid":"34/5636","text":"Ramesh Hariharan"}]},"title":"Approximate Hypergraph Coloring.","venue":"Nord. J. Comput.","volume":"3","number":"4","pages":"425-439","year":"1996","type":"Journal Articles","access":"unavailable","key":"journals/njc/AlonKMH96","url":"https://dblp.org/rec/journals/njc/AlonKMH96"}, "url":"URL#6690539" }, { "@score":"1", "@id":"6690540", "info":{"authors":{"author":[{"@pid":"a/CHAng","text":"Chuan-Heng Ang"},{"@pid":"s/HananSamet","text":"Hanan Samet"}]},"title":"Approximate Average Storage Utilization of Bucket Methods with Arbitrary Fanout.","venue":"Nord. J. Comput.","volume":"3","number":"3","pages":"280-291","year":"1996","type":"Journal Articles","access":"unavailable","key":"journals/njc/AngS96","url":"https://dblp.org/rec/journals/njc/AngS96"}, "url":"URL#6690540" }, { "@score":"1", "@id":"6690541", "info":{"authors":{"author":[{"@pid":"21/1336","text":"Takao Asano"},{"@pid":"61/774","text":"Takao Ono"},{"@pid":"59/2943","text":"Tomio Hirata"}]},"title":"Approximation Algorithms for the Maximum Satisfiability Problem.","venue":"Nord. J. Comput.","volume":"3","number":"4","pages":"388-404","year":"1996","type":"Journal Articles","access":"unavailable","key":"journals/njc/AsanoOH96","url":"https://dblp.org/rec/journals/njc/AsanoOH96"}, "url":"URL#6690541" }, { "@score":"1", "@id":"6690542", "info":{"authors":{"author":{"@pid":"b/GerthStoltingBrodal","text":"Gerth Stølting Brodal"}},"title":"Partially Persistent Data Structures of Bounded Degree with Constant Update Time.","venue":"Nord. J. Comput.","volume":"3","number":"3","pages":"238-255","year":"1996","type":"Journal Articles","access":"unavailable","key":"journals/njc/Brodal96","url":"https://dblp.org/rec/journals/njc/Brodal96"}, "url":"URL#6690542" }, { "@score":"1", "@id":"6690543", "info":{"authors":{"author":[{"@pid":"b/GerthStoltingBrodal","text":"Gerth Stølting Brodal"},{"@pid":"85/4978","text":"Shiva Chaudhuri"},{"@pid":"89/5476","text":"Jaikumar Radhakrishnan"}]},"title":"The Randomized Complexity of Maintaining the Minimum.","venue":"Nord. J. Comput.","volume":"3","number":"4","pages":"337-351","year":"1996","type":"Journal Articles","access":"unavailable","key":"journals/njc/BrodalCR96","url":"https://dblp.org/rec/journals/njc/BrodalCR96"}, "url":"URL#6690543" }, { "@score":"1", "@id":"6690544", "info":{"authors":{"author":[{"@pid":"23/3171","text":"Cynthia A. Brown"},{"@pid":"84/5155","text":"Larry Finkelstein"},{"@pid":"74/5420","text":"Paul Walton Purdom Jr."}]},"title":"Backtrack Searching in the Presence of Symmetry.","venue":"Nord. J. Comput.","volume":"3","number":"3","pages":"203-219","year":"1996","type":"Journal Articles","access":"unavailable","key":"journals/njc/BrownFP96","url":"https://dblp.org/rec/journals/njc/BrownFP96"}, "url":"URL#6690544" }, { "@score":"1", "@id":"6690545", "info":{"authors":{"author":{"@pid":"14/5560","text":"J.-C. Chen"}},"title":"Proportion Split Sort.","venue":"Nord. J. Comput.","volume":"3","number":"3","pages":"271-279","year":"1996","type":"Journal Articles","access":"unavailable","key":"journals/njc/Chen96","url":"https://dblp.org/rec/journals/njc/Chen96"}, "url":"URL#6690545" }, { "@score":"1", "@id":"6690546", "info":{"authors":{"author":[{"@pid":"80/1045","text":"Amitava Datta"},{"@pid":"m/AnilMaheshwari","text":"Anil Maheshwari"},{"@pid":"s/JRSack","text":"Jörg-Rüdiger Sack"}]},"title":"Optimal Parallel Algorithms for Direct Dominance Problems.","venue":"Nord. J. Comput.","volume":"3","number":"1","pages":"72-88","year":"1996","type":"Journal Articles","access":"unavailable","key":"journals/njc/DattaMS96","url":"https://dblp.org/rec/journals/njc/DattaMS96"}, "url":"URL#6690546" }, { "@score":"1", "@id":"6690547", "info":{"authors":{"author":[{"@pid":"d/KDiks","text":"Krzysztof Diks"},{"@pid":"p/AndrzejPelc","text":"Andrzej Pelc"}]},"title":"Fault-Tolerant Linear Broadcasting.","venue":"Nord. J. Comput.","volume":"3","number":"2","pages":"188-201","year":"1996","type":"Journal Articles","access":"unavailable","key":"journals/njc/DiksP96","url":"https://dblp.org/rec/journals/njc/DiksP96"}, "url":"URL#6690547" }, { "@score":"1", "@id":"6690548", "info":{"authors":{"author":[{"@pid":"e/PeterEades","text":"Peter Eades"},{"@pid":"k/JMarkKeil","text":"J. Mark Keil"},{"@pid":"24/4096","text":"Paul D. Manuel"},{"@pid":"m/MirkaMiller","text":"Mirka Miller"}]},"title":"Two Minimum Dominating Sets with Minimum Intersection in Chordal Graphs.","venue":"Nord. J. Comput.","volume":"3","number":"3","pages":"220-237","year":"1996","type":"Journal Articles","access":"unavailable","key":"journals/njc/EadesKMM96","url":"https://dblp.org/rec/journals/njc/EadesKMM96"}, "url":"URL#6690548" }, { "@score":"1", "@id":"6690549", "info":{"authors":{"author":[{"@pid":"62/3259","text":"David Fernández-Baca"},{"@pid":"85/7008","text":"Giora Slutzki"},{"@pid":"e/DEppstein","text":"David Eppstein"}]},"title":"Using Sparsification for Parametric Minimum Spanning Tree Problems.","venue":"Nord. J. Comput.","volume":"3","number":"4","pages":"352-366","year":"1996","type":"Journal Articles","access":"unavailable","key":"journals/njc/Fernandez-BacaSE96","url":"https://dblp.org/rec/journals/njc/Fernandez-BacaSE96"}, "url":"URL#6690549" }, { "@score":"1", "@id":"6690550", "info":{"authors":{"author":[{"@pid":"71/576","text":"Thore Husfeldt"},{"@pid":"61/367","text":"Theis Rauhe"},{"@pid":"52/219","text":"Søren Skyum"}]},"title":"Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parantheses Matching.","venue":"Nord. J. Comput.","volume":"3","number":"4","pages":"323-336","year":"1996","type":"Journal Articles","access":"unavailable","key":"journals/njc/HusfeldtRS96","url":"https://dblp.org/rec/journals/njc/HusfeldtRS96"}, "url":"URL#6690550" }, { "@score":"1", "@id":"6690551", "info":{"authors":{"author":[{"@pid":"04/5814","text":"Rolf G. Karlsson"},{"@pid":"l/AndrzejLingas","text":"Andrzej Lingas"}]},"title":"Guest Editor's Foreword.","venue":"Nord. J. Comput.","volume":"3","number":"4","pages":"293-294","year":"1996","type":"Journal Articles","access":"unavailable","key":"journals/njc/KarlssonL96","url":"https://dblp.org/rec/journals/njc/KarlssonL96"}, "url":"URL#6690551" }, { "@score":"1", "@id":"6690552", "info":{"authors":{"author":[{"@pid":"90/1764","text":"Jyrki Katajainen"},{"@pid":"07/2613","text":"Tomi Pasanen"},{"@pid":"t/JukkaTeuhola","text":"Jukka Teuhola"}]},"title":"Practical In-Place Mergesort.","venue":"Nord. J. Comput.","volume":"3","number":"1","pages":"27-40","year":"1996","type":"Journal Articles","access":"unavailable","key":"journals/njc/KatajainenPT96","url":"https://dblp.org/rec/journals/njc/KatajainenPT96"}, "url":"URL#6690552" }, { "@score":"1", "@id":"6690553", "info":{"authors":{"author":[{"@pid":"l/TakWahLam","text":"Tak Wah Lam"},{"@pid":"s/WingKinSung","text":"Wing-Kin Sung"},{"@pid":"t/HingFungTing","text":"Hing-Fung Ting"}]},"title":"Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time.","venue":"Nord. J. Comput.","volume":"3","number":"4","pages":"295-322","year":"1996","type":"Journal Articles","access":"unavailable","key":"journals/njc/LamST96","url":"https://dblp.org/rec/journals/njc/LamST96"}, "url":"URL#6690553" }, { "@score":"1", "@id":"6690554", "info":{"authors":{"author":[{"@pid":"27/6572","text":"Hoong Chuin Lau"},{"@pid":"w/OsamuWatanabe1","text":"Osamu Watanabe 0001"}]},"title":"Randomized Approximation of the Constraint Satisfaction Problem.","venue":"Nord. J. Comput.","volume":"3","number":"4","pages":"405-424","year":"1996","type":"Journal Articles","access":"unavailable","key":"journals/njc/LauW96","url":"https://dblp.org/rec/journals/njc/LauW96"}, "url":"URL#6690554" }, { "@score":"1", "@id":"6690555", "info":{"authors":{"author":[{"@pid":"50/11385","text":"Chih-Zong Lin"},{"@pid":"89/971","text":"Chien-Chao Tseng"},{"@pid":"130/5338","text":"Yi-Lin Chen"},{"@pid":"349/7045","text":"Tso-Wei Kuo"}]},"title":"A Systematic Approach to Synthesize Data Alignment Directives for Distributed Memory Machines.","venue":"Nord. J. Comput.","volume":"3","number":"2","pages":"89-119","year":"1996","type":"Journal Articles","access":"unavailable","key":"journals/njc/LinTCK96","url":"https://dblp.org/rec/journals/njc/LinTCK96"}, "url":"URL#6690555" }, { "@score":"1", "@id":"6690556", "info":{"authors":{"author":{"@pid":"89/179","text":"Henrik Linnestad"}},"title":"Fatal Steps of Knuth-Bendix Completion. Nordic Journal of Computing.","venue":"Nord. J. Comput.","volume":"3","number":"2","pages":"131-143","year":"1996","type":"Journal Articles","access":"unavailable","key":"journals/njc/Linnestad96","url":"https://dblp.org/rec/journals/njc/Linnestad96"}, "url":"URL#6690556" }, { "@score":"1", "@id":"6690557", "info":{"authors":{"author":{"@pid":"11/5050","text":"Lauri Malmi"}},"title":"A New Method for Updating and Rebalancing Tree-Type Main Memory Dictionaries.","venue":"Nord. J. Comput.","volume":"3","number":"2","pages":"111-130","year":"1996","type":"Journal Articles","access":"unavailable","key":"journals/njc/Malmi96","url":"https://dblp.org/rec/journals/njc/Malmi96"}, "url":"URL#6690557" }, { "@score":"1", "@id":"6690558", "info":{"authors":{"author":[{"@pid":"52/991","text":"Madhav V. Marathe"},{"@pid":"r/RRavi-1","text":"R. Ravi 0001"},{"@pid":"s/RaviSundaram","text":"Ravi Sundaram"}]},"title":"Service-Constrained Network Design Problems.","venue":"Nord. J. Comput.","volume":"3","number":"4","pages":"367-387","year":"1996","type":"Journal Articles","access":"unavailable","key":"journals/njc/MaratheRS96","url":"https://dblp.org/rec/journals/njc/MaratheRS96"}, "url":"URL#6690558" }, { "@score":"1", "@id":"6690559", "info":{"authors":{"author":[{"@pid":"03/6837","text":"Sridhar Natarajan"},{"@pid":"s/AlanPSprague","text":"Alan P. Sprague"}]},"title":"Disjoint Paths in Circular Arc Graphs.","venue":"Nord. J. Comput.","volume":"3","number":"3","pages":"256-270","year":"1996","type":"Journal Articles","access":"unavailable","key":"journals/njc/NatarajanS96","url":"https://dblp.org/rec/journals/njc/NatarajanS96"}, "url":"URL#6690559" }, { "@score":"1", "@id":"6690560", "info":{"authors":{"author":[{"@pid":"n/FlemmingNielson","text":"Flemming Nielson"},{"@pid":"n/HanneRiisNielson","text":"Hanne Riis Nielson"}]},"title":"Operational Semantics of Termination Types.","venue":"Nord. J. Comput.","volume":"3","number":"2","pages":"144-187","year":"1996","type":"Journal Articles","access":"unavailable","key":"journals/njc/NielsonN96","url":"https://dblp.org/rec/journals/njc/NielsonN96"}, "url":"URL#6690560" }, { "@score":"1", "@id":"6690561", "info":{"authors":{"author":{"@pid":"s/HelmutSeidl","text":"Helmut Seidl"}},"title":"Least and Greatest Solutions of Equations over N.","venue":"Nord. J. Comput.","volume":"3","number":"1","pages":"41-62","year":"1996","type":"Journal Articles","access":"unavailable","key":"journals/njc/Seidl96","url":"https://dblp.org/rec/journals/njc/Seidl96"}, "url":"URL#6690561" }, { "@score":"1", "@id":"6690562", "info":{"authors":{"author":[{"@pid":"30/325","text":"Yung H. Tsin"},{"@pid":"29/6007","text":"Cao An Wang"}]},"title":"Geodesic Voronoi Diagrams in the Presence of Rectilinear Barriers.","venue":"Nord. J. Comput.","volume":"3","number":"1","pages":"1-26","year":"1996","type":"Journal Articles","access":"unavailable","key":"journals/njc/TsinW96","url":"https://dblp.org/rec/journals/njc/TsinW96"}, "url":"URL#6690562" } ] } } } )