Filters








15,208 Hits in 4.5 sec

Deep Fuzzy Systems [article]

Khaled Ahmed Nagaty
<span title="2019-05-23">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
A deep fuzzy system is represented by recursive fuzzy systems from an input terminal to output terminal.  ...  A recursive fuzzy system which calls a fuzzy system n times includes fuzzy chains to evaluate the final grade membership of this recursive system.  ...  Algorithm 3 This algorithm is based on Warshall algorithm in [2] to compute the transitive closure of a recursive binary matrix. 1.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1906.08222v1">arXiv:1906.08222v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/oz3xcj7f3vhbhorlyuhn265zgi">fatcat:oz3xcj7f3vhbhorlyuhn265zgi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191222035105/https://arxiv.org/pdf/1906.08222v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/6e/64/6e640dedc7187be77a6ecb3605d25168ecdf1185.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1906.08222v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Page 5680 of Mathematical Reviews Vol. , Issue 93j [page]

<span title="">1993</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
SPCR includes many common linear recursions, such as transitive closure, one-sided recursion, and the single linear sub- class of asynchronous chain recursion.  ...  Summary: “We study a class of linear recursions called simple prefixed-chain recursions (SPCR).  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1993-10_93j/page/5680" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1993-10_93j/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Recursive domains in proteins

Teresa Przytycka, Rajgopal Srinivasan, George D. Rose
<span title="2009-01-01">2009</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6bubxfqklvdwthsc43yvjbtjae" style="color: black;">Protein Science</a> </i> &nbsp;
In this paper, we explore the extent to which four simple rules can generate the known all-␤ folds, using tools from graph theory.  ...  As a control, an exhaustive set of ␤-sandwiches was tested and found to be largely incompatible with such a grammar.  ...  This article must therefore be hereby marked "advertisement" in accordance with 18 USC section 1734 solely to indicate this fact.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1110/ps.24701">doi:10.1110/ps.24701</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/11790851">pmid:11790851</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC2373444/">pmcid:PMC2373444</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hle4i4yh3jdvdetn6ekcitdi2m">fatcat:hle4i4yh3jdvdetn6ekcitdi2m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060916000737/http://zlab.bu.edu/~josephs/papers/przytycka-2002-recur.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e1/ad/e1adb6523e118f6d1087a2d892d5ad47012147c5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1110/ps.24701"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2373444" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>

The pushdown method to optimize chain logic programs [chapter]

Sergio Greco, Domenico Saccà, Carlo Zaniolo
<span title="">1995</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We propose a novel approach that solves this problem for chain queries, i.e., for queries where bindings are propagated from arguments in the head to arguments in the tail of the rules, in a chain-like  ...  It also succeeds in reducing many non-linear programs to query-equivalent linear ones.  ...  Right-linear Transitive Closure. Consider the following right-linear q-chain query Q =< path(b, Y), P >, where q = {path} and P is: path(X, Y) ← arc(X, Y). path(X, Y) ← arc(X, Z), path(Z, Y).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-60084-1_102">doi:10.1007/3-540-60084-1_102</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ysgy6tz66bfxpipp7f5bfxkude">fatcat:ysgy6tz66bfxpipp7f5bfxkude</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20030314081456/http://www.cs.ucla.edu:80/~zaniolo/papers/icalp95.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c7/f8/c7f89b5748e83e728aa960a39c68f03c5fe76652.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-60084-1_102"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Storage allocation strategies for recursive attribute evaluators [chapter]

Kazunori Mizushima, Takuya Katayama
<span title="">1998</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
As for the time, single-chain method gives the best result and multi-chain methods look to be practical.  ...  Improvement of the Single-Chain M e t h o d In allocating storage to attributes, we must not ignore copy rule which only passes a value from an attribute to another.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bfb0026422">doi:10.1007/bfb0026422</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hvkiuqb76jeoxbo3rbino7k5wu">fatcat:hvkiuqb76jeoxbo3rbino7k5wu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180728103535/https://link.springer.com/content/pdf/10.1007%2FBFb0026422.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/93/d0/93d0de7142f9bb329a6fedebb65a93e7a4dd7274.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bfb0026422"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Melting behavior and different bound states in three-stranded DNA models

Jaya Maji, Somendra M. Bhattacharjee, Flavio Seno, Antonio Trovato
<span title="2014-01-15">2014</span> <i title="American Physical Society (APS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/nuk2stxzvvhf7ljciu325kj77m" style="color: black;">Physical Review E</a> </i> &nbsp;
pair-wise bound but without three chain contacts.  ...  Within this framework, the existence of a three strand DNA bound state in conditions where a duplex DNA would be in the denaturated state was recently predicted from a study of three directed polymer models  ...  In the latter case the two transitions are from the unbound to the mixed state and from the mixed to the three-chain bound state. VII.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1103/physreve.89.012121">doi:10.1103/physreve.89.012121</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/24580186">pmid:24580186</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2gwoesah2vcapf22ors7aqnzpm">fatcat:2gwoesah2vcapf22ors7aqnzpm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808220917/http://www.iopb.res.in/~somen/SMB_papers/jaya_Gasket_pre14.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5a/6a/5a6abd153138abcb3c371a6fa4180661b5eecfe0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1103/physreve.89.012121"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> aps.org </button> </a>

Incremental recomputation in local languages

Guozhu Dong, Leonid Libkin, Limsoon Wong
<span title="">2003</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/joe2ngto45hbnl3pncnesnq344" style="color: black;">Information and Computation</a> </i> &nbsp;
We study the problem of maintaining recursively defined views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanisms.  ...  The property we use is locality of queries, which is known to hold for relational calculus and various extensions, including those with grouping and aggregate constructs (essentially, plain SQL).  ...  Acknowledgments The authors wish to thank Neil Immerman for his comments on the paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0890-5401(03)00017-8">doi:10.1016/s0890-5401(03)00017-8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/l7hl2h5dgbc45ifydmstrjbeti">fatcat:l7hl2h5dgbc45ifydmstrjbeti</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170928075624/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/61e/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDg5MDU0MDEwMzAwMDE3OA%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/cf/66/cf6626fea25292fa2ca42f8b86bba0fb49fa52ef.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0890-5401(03)00017-8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Efficient evaluation for a subset of recursive queries

Gösta Grahne, Seppo Sippu, Eljas Soisalon-Soininen
<span title="">1991</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7qdabej4lbaczotmeg3ldn4ioy" style="color: black;">The Journal of Logic Programming</a> </i> &nbsp;
However, using a general method to solve a simple query may not be practical if no increase in the efficiency of the evaluation can be gained from the simplicity of the query.  ...  OF RECURSIVE QUERIES  ...  it is always possible to express an arbitrary linearly recursive query as a transitive closure of a single binary relation.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0743-1066(91)90039-r">doi:10.1016/0743-1066(91)90039-r</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zjjbx6cbozgrlmiyopgdaxgqp4">fatcat:zjjbx6cbozgrlmiyopgdaxgqp4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190324024922/https://core.ac.uk/download/pdf/82323597.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/75/64/7564b20a42616d06b292736ad44c454b357adb33.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0743-1066(91)90039-r"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Automated Generation of Itineraries in Recommender Systems for Tourism [chapter]

Pierpaolo Di Bitonto, Francesco Di Tria, Maria Laterza, Teresa Roselli, Veronica Rossano, Filippo Tangorra
<span title="">2010</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
able to construct chains of events.  ...  The method is based on a theoretical model that defines space-time relations among items of intangible cultural heritage (called events) and on transitive closure computation (of the relations), that is  ...  execute recursive queries and to compute the transitive closure.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-16985-4_48">doi:10.1007/978-3-642-16985-4_48</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ly2ol434knh3tbchn73whuvzwu">fatcat:ly2ol434knh3tbchn73whuvzwu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20181030071900/https://link.springer.com/content/pdf/10.1007%2F978-3-642-16985-4_48.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/16/b7/16b76763675c74f94c4866508da0b864324582b4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-16985-4_48"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Decomposability and its role in parallel logic-program evaluation

Ouri Wolfson, Avi Silberschatz
<span title="">1991</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7qdabej4lbaczotmeg3ldn4ioy" style="color: black;">The Journal of Logic Programming</a> </i> &nbsp;
We completely syntactically characterize three classes of single-rule programs with respect to decomposability: nonrecursive, simple linear, and simple chain programs.  ...  Q is recursive if (Q, Q) is in the nonreflexive transitive closure of the "derives" relation. A program is recursive if it has a recursive predicate.  ...  "Only if': Immediate from Lemmas 3 and 4. q SIMPLE CHAIN PROGRAMS A simple chain program is a recursive sirup in which: (1) where the A, B, C, D are base relations.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0743-1066(91)90031-j">doi:10.1016/0743-1066(91)90031-j</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sb3mbcg44rgu7k6a6vy6gc2azu">fatcat:sb3mbcg44rgu7k6a6vy6gc2azu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190223053533/https://core.ac.uk/download/pdf/82382727.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/10/72/1072af615d4e7714c1fb08865f2627db36b16ec2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0743-1066(91)90031-j"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Transitive closure and recursive Datalog implemented on clusters

Foto N. Afrati, Jeffrey D. Ullman
<span title="">2012</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/25kc37fuhndb5axzv75226fwem" style="color: black;">Proceedings of the 15th International Conference on Extending Database Technology - EDBT &#39;12</a> </i> &nbsp;
In particular, we consider the endgame problem: later rounds of a recursion often transfer only small amounts of data, causing high overhead for interprocessor communication. One way to deal with  ...  Implementing recursive algorithms on computing clusters presents a number of new challenges.  ...  For transitive closure, it is possible to solve the endgame problem by using a nonlinear recursion.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2247596.2247613">doi:10.1145/2247596.2247613</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/edbt/AfratiU12.html">dblp:conf/edbt/AfratiU12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tf2gsgui3nbh3emwxde6kqien4">fatcat:tf2gsgui3nbh3emwxde6kqien4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829134034/http://openproceedings.org/2012/conf/edbt/AfratiU12.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/07/c4/07c497ba855a346e72a1e8e348751e5679a2267f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2247596.2247613"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Map-reduce extensions and recursive queries

Foto N. Afrati, Vinayak Borkar, Michael Carey, Neoklis Polyzotis, Jeffrey D. Ullman
<span title="">2011</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/25kc37fuhndb5axzv75226fwem" style="color: black;">Proceedings of the 14th International Conference on Extending Database Technology - EDBT/ICDT &#39;11</a> </i> &nbsp;
We survey the recent wave of extensions to the popular mapreduce systems, including those that have begun to address the implementation of recursive queries using the same computing environment as map-reduce  ...  A central problem is that recursive tasks cannot deliver their output only at the end, which makes recovery from failures much more complicated than in map-reduce and its nonrecursive extensions.  ...  Transitive Closure Each of the recursions mentioned in Section 1 is similar to the standard calculation of transitive closure (hereafter TC ) on a directed graph.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1951365.1951367">doi:10.1145/1951365.1951367</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/edbt/AfratiBCPU11.html">dblp:conf/edbt/AfratiBCPU11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/l2uouka555hvjganb4ifdbdfze">fatcat:l2uouka555hvjganb4ifdbdfze</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809091521/http://openproceedings.org/2011/conf/edbt/AfratiBCPU11.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/dd/2a/dd2adca6ea8ed7ab26f13dbb1cb658c4bb4b8df2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1951365.1951367"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Subcubic algorithms for recursive state machines

Swarat Chaudhuri
<span title="2008-01-14">2008</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xu5bk2lj5rbdxlx6222nw7tsxi" style="color: black;">SIGPLAN notices</a> </i> &nbsp;
We show that the reachability problem for recursive state machines (or equivalently, pushdown systems), believed for long to have cubic worst-case complexity, can be solved in slightly subcubic time.  ...  We also show that a better algorithm exists if the input machine does not have infinite recursive loops.  ...  An anonymous referee pointed out that Rytter's speedup could be applied directly to the classical CFL-reachability algorithm; we thank him or her for this.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1328897.1328460">doi:10.1145/1328897.1328460</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/maud3jc4kjgjddgbxtwacnwlr4">fatcat:maud3jc4kjgjddgbxtwacnwlr4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810212127/https://www.cs.rice.edu/~sc40/pubs/popl08.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/31/8e/318e309c7874f5c524110e5b5dcc5ec0cbc9b96e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1328897.1328460"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Subcubic algorithms for recursive state machines

Swarat Chaudhuri
<span title="">2008</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2qaxtqe2rfgjnfefqcokcnzelq" style="color: black;">Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL &#39;08</a> </i> &nbsp;
We show that the reachability problem for recursive state machines (or equivalently, pushdown systems), believed for long to have cubic worst-case complexity, can be solved in slightly subcubic time.  ...  We also show that a better algorithm exists if the input machine does not have infinite recursive loops.  ...  An anonymous referee pointed out that Rytter's speedup could be applied directly to the classical CFL-reachability algorithm; we thank him or her for this.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1328438.1328460">doi:10.1145/1328438.1328460</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/popl/Chaudhuri08.html">dblp:conf/popl/Chaudhuri08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fb24zqeflngwnbzijjwpxxkv7i">fatcat:fb24zqeflngwnbzijjwpxxkv7i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810212127/https://www.cs.rice.edu/~sc40/pubs/popl08.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/31/8e/318e309c7874f5c524110e5b5dcc5ec0cbc9b96e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1328438.1328460"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

A survey of parallel execution strategies for transitive closure and logic programs

Filippo Cacace, Stefano Ceri, Maurice Houtsma
<span title="">1993</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/of3bmcozzfddjojxsoxwzys55y" style="color: black;">Distributed and parallel databases</a> </i> &nbsp;
With the development of new query languages, and in particular with the definition of transitive closure queries and of more general logic programming queries, the new dimension of recursion has been added  ...  We observe that research on parallel execution of recursive queries is separated into two distinct subareas, one focused on the transitive closure of Relational Algebra expressions, the other one focused  ...  Acknowledgments The authors wish to thank anonymous referees for stimulating several additions and improvements to preliminary versions of this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bf01264013">doi:10.1007/bf01264013</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pe4vicsr3vctzoj437towrkdv4">fatcat:pe4vicsr3vctzoj437towrkdv4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180720034809/https://ris.utwente.nl/ws/files/6787409/fulltext.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/24/03/24032a2b066de0c3a5351d82f13ba3e42b20f0d9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bf01264013"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 15,208 results