Nord. J. Comput.最新文献_第3页

Pattern-Matching Problems for Two-Dimensional Images Described by Finite Automata 有限自动机描述的二维图像模式匹配问题

Nord. J. Comput. Pub Date : 1997-09-01 DOI: 10.1007/BFb0036188

J. Karhumäki, Wojciech Plandowski, W. Rytter

引用次数: 14

The Persistent Workshop - a Programming Environment for Napier88 持久性工作坊- Napier88的编程环境

Nord. J. Comput. Pub Date : 1997-03-01 DOI: 10.1007/978-3-642-59623-0_45

Dag I.K. Sjøberg, R. Welland, M. Atkinson, Paul Philbrow, C. Waite, S. Macneill

引用次数: 4

Approximation Algorithms for the Maximum Satisfiability Problem 最大可满足性问题的近似算法

Nord. J. Comput. Pub Date : 1996-07-03 DOI: 10.1007/3-540-61422-2_124

Takao Asano, Takao Ono, T. Hirata

引用次数: 45

Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parantheses Matching 动态传递闭包、平面点定位和括号匹配的下界

Nord. J. Comput. Pub Date : 1996-01-09 DOI: 10.7146/BRICS.V3I9.19972

T. Husfeldt, Theis Rauhe, Søren Skyum

{"title":"Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parantheses Matching","authors":"T. Husfeldt, Theis Rauhe, Søren Skyum","doi":"10.7146/BRICS.V3I9.19972","DOIUrl":"https://doi.org/10.7146/BRICS.V3I9.19972","url":null,"abstract":"We give a number of new lower bounds in the cell probe model with logarithmic cell size, which entails the same bounds on the random access computer with logarithmic word size and unit cost operations. We study the signed prefix sum problem: given a string of length n of zeroes and signed ones, compute the sum of its ith prefix during updates. We show a lower bound of Omega(log n/log log n) time per operations, even if the prefix sums are bounded by log n/log log n during all updates. We also show that if the update time is bounded by the product of the worst-case update time and the answer to the query, then the update time must be Omega(sqrt(log n/ log log n)). These results allow us to prove lower bounds for a variety of seemingly unrelated dynamic problems. We give a lower bound for the dynamic planar point location in monotone subdivisions of Omega(log n/ log log n) per operation. We give a lower bound for the dynamic transitive closure problem on upward planar graphs with one source and one sink of Omega(log n/(log logn)^2) per operation. We give a lower bound of Omega(sqrt(log n/log log n)) for the dynamic membership problem of any Dyck language with two or more letters. This implies the same lower bound for the dynamic word problem for the free group with k generators. We also give lower bounds for the dynamic prefix majority and prefix equality problems.","PeriodicalId":114503,"journal":{"name":"Nord. J. Comput.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115046674","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 11

Synthesizing Distinguishing Formulae for Real Time Systems 实时系统的综合判别公式

Nord. J. Comput. Pub Date : 1994-12-10 DOI: 10.7146/BRICS.V1I48.21594

Jens Chr. Godskesen, K. Larsen

引用次数: 16

Partially Persistent Data Structures of Bounded Degree with Constant Update Time 具有恒定更新时间的有界度部分持久数据结构

Nord. J. Comput. Pub Date : 1994-11-30 DOI: 10.7146/BRICS.V1I35.21608

G. Brodal

引用次数: 42

Sparse Networks Supporting Efficient Reliable Broadcasting 支持高效可靠广播的稀疏网络

Nord. J. Comput. Pub Date : 1994-09-01 DOI: 10.1007/3-540-56939-1_88

Bogdan S. Chlebus, K. Diks, A. Pelc