Filters








15,271 Hits in 4.6 sec

Directed acyclic subsequence graph—Overview

Maxime Crochemore, Bořivoj Melichar, Zdeněk Tronı́ček
<span title="">2003</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/usw2n4yaarcurchx7i4on2iqea" style="color: black;">Journal of Discrete Algorithms</a> </i> &nbsp;
For this purpose we build an automaton that accepts all subsequences of given texts. This automaton is called the Directed Acyclic Subsequence Graph (DASG).  ...  The subsequence matching problem is to decide, for given strings S and T , whether S is a subsequence of T . The string S is called the pattern and the string T the text.  ...  Baeza-Yates [1] called this automaton Directed Acyclic Subsequence Graph (DASG).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s1570-8667(03)00029-7">doi:10.1016/s1570-8667(03)00029-7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/aovuzvwk5bc7bdudr5loz7azua">fatcat:aovuzvwk5bc7bdudr5loz7azua</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171001195437/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/a97/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMTU3MDg2NjcwMzAwMDI5Nw%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/59/f0/59f0f19d3864b639ba0f465d030214f2a6ea881f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s1570-8667(03)00029-7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Overview and Warmup Example for Perturbation Theory with Instantons [article]

Scott Axelrod
<span title="1996-03-08">1996</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We also overview how this definition can be adapted to the context of 3-dimensional Chern--Simons quantum field theory where F is infinite dimensional.  ...  In this paper we overview a formulation of the "Feynman rules" computing this top form and a proof that the perturbation series one obtains is independent of the choice of metric on F needed to define  ...  the acyclic case.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/hep-th/9511196v2">arXiv:hep-th/9511196v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/riiqq35jvnguld2v4gvsguovu4">fatcat:riiqq35jvnguld2v4gvsguovu4</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-hep-th9511196/hep-th9511196.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> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/hep-th/9511196v2" 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>

Formal Concept Analysis – Overview and Applications

Frano Škopljanac-Mačina, Bruno Blašković
<span title="">2014</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5i4djr4tgnbobnjegejzpw7nny" style="color: black;">Procedia Engineering</a> </i> &nbsp;
From given tabular input data this method finds all formal concepts and computes a concept lattice, a directed, acyclic graph, in which all formal concepts are hierarchically ordered.  ...  In this article we give a brief overview of the theory behind the formal concept analysis, a novel method for data representation and analysis.  ...  Topological sorting Concept lattice with the partial order B(X,Y,I), is a directed acyclic graph (DAG) whose nodes are formal concepts connected by directed edges (always from superconcepts to subconcepts  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.proeng.2014.03.117">doi:10.1016/j.proeng.2014.03.117</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/23twdeahgneadorwbri3lkmjem">fatcat:23twdeahgneadorwbri3lkmjem</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190417134152/https://core.ac.uk/download/pdf/82259701.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/ef/86/ef865fb33c7dbaec3255a82b18848f9779f4bc7a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.proeng.2014.03.117"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> elsevier.com </button> </a>

Instruction-level parallel processing: History, overview, and perspective

B. Ramakrishna Rau, Joseph A. Fisher
<span title="">1993</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qhbautqnvzgwvm3vvdvieylhwq" style="color: black;">Journal of Supercomputing</a> </i> &nbsp;
This article provides an overview and historical perspective of the field of ILP and its development over the past three decades.  ...  Stripped to the essentials, this algorithm defines applies a cut-set, termed a fence, to the cyclic graph which yields an acyclic graph.  ...  An arbitrary, acyclic control flow graph, having a single entry can be handled by this technique.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bf01205181">doi:10.1007/bf01205181</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/v7uhz4km5ndxzhr7baybks2bn4">fatcat:v7uhz4km5ndxzhr7baybks2bn4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20131020200759/http://www.hpl.hp.com/techreports/92/HPL-92-132.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/d7/c6/d7c6c8334182c9fa03b73eae3a1ab01f4f47fae7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bf01205181"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Instruction-Level Parallel Processing: History, Overview, and Perspective [chapter]

B. Ramakrishna Rau, Joseph A. Fisher
<span title="">1993</span> <i title="Springer US"> Instruction-Level Parallelism </i> &nbsp;
This article provides an overview and historical perspective of the field of ILP and its development over the past three decades.  ...  Stripped to the essentials, this algorithm defines applies a cut-set, termed a fence, to the cyclic graph which yields an acyclic graph.  ...  An arbitrary, acyclic control flow graph, having a single entry can be handled by this technique.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4615-3200-2_3">doi:10.1007/978-1-4615-3200-2_3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/eg7nutqurffxfj2y62g5lfc57m">fatcat:eg7nutqurffxfj2y62g5lfc57m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20131020200759/http://www.hpl.hp.com/techreports/92/HPL-92-132.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/d7/c6/d7c6c8334182c9fa03b73eae3a1ab01f4f47fae7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4615-3200-2_3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Parameterized Algorithms in Bioinformatics: An Overview

Laurent Bulteau, Mathias Weller
<span title="2019-12-01">2019</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/63zsvf7vxzfznojpqgfvpyk2lu" style="color: black;">Algorithms</a> </i> &nbsp;
Herein, "acyclic" makes reference to the constraint that the "inheritance graph is acyclic" (see Figure 9 ).  ...  A rooted phylogenetic network N is a rooted acyclic directed graph whose non-root nodes either have in-degree one or out-degree one and whose out-degree-zero nodes L(T) ("leaves") are labeled (by "taxa  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/a12120256">doi:10.3390/a12120256</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4dhjdnpibzh43iifgan2fu6bwa">fatcat:4dhjdnpibzh43iifgan2fu6bwa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200213035509/https://res.mdpi.com/d_attachment/algorithms/algorithms-12-00256/article_deploy/algorithms-12-00256-v3.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/71/5f/715fdbea73d0f7a1c20ac935c66fd8d113851989.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/a12120256"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mdpi.com </button> </a>

An overview of PCTE and PCTE+

Gerard Boudier, Ferdinando Gallo, Regis Minot, Ian Thomas
<span title="">1988</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2zoopxiifbdwjjcag3arwring4" style="color: black;">Proceedings of the third ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments - SDE 3</a> </i> &nbsp;
In PCTE+ this is generalised into a DAG (Directed Acyclic Graph) of types (multiple inheritance).  ...  A facility is provided to add predecessor links so that the version graph can represent merging of versions in the form of a directed acyclic graph (DAG).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/64135.65026">doi:10.1145/64135.65026</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/sde/BoudierGMT88.html">dblp:conf/sde/BoudierGMT88</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/unc7cl3mnffwxp44rb7wzlpx34">fatcat:unc7cl3mnffwxp44rb7wzlpx34</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20120128061645/http://www.isr.uci.edu/~andre/ics228s2006/boudiergallominotthomas.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/9f/df/9fdfa244e118e4695a2651bae33005f86cd2a27f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/64135.65026"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

GUPRO - Generic Understanding of Programs An Overview

Jürgen Ebert, Bernt Kullbach, Volker Riediger, Andreas Winter
<span title="">2002</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/uy5mv2ncw5eahkdx47hkrglxmm" style="color: black;">Electronical Notes in Theoretical Computer Science</a> </i> &nbsp;
GUPRO is based on graph-technology. It heavily relies on graph querying and graph algorithms.  ...  Source code is extracted into a graph repository which can be viewed by an integrated querying and browsing facility.  ...  typed graphs, ordered graphs, relational graphs, acyclic graphs, trees, etc. or combinations of these.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s1571-0661(05)80528-6">doi:10.1016/s1571-0661(05)80528-6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tcrvwqu6vnffxmqbcx7psk24nm">fatcat:tcrvwqu6vnffxmqbcx7psk24nm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190414020220/https://core.ac.uk/download/pdf/82403930.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/b9/34/b93411f0002f41164695a2195f894148e1db3c14.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s1571-0661(05)80528-6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> elsevier.com </button> </a>

An overview of reconstructability analysis

Martin Zwick
<span title="">2004</span> <i title="Emerald"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/b5f3hkillzhrrax65x3trvccwm" style="color: black;">Kybernetes</a> </i> &nbsp;
In RA terminology this is a directed system, since inputs and outputs ("independent variables" and "dependent variables") Overview of Reconstructability Analysis M.Zwick 2 are distinguished.  ...  Directed systems are further classified as deterministic or stochastic.  ...  (We do not here employ a notation which explicitly shows directedness, e.g., A → C, any relation or distribution written as a string of letters may be either neutral or directed.)  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1108/03684920410533958">doi:10.1108/03684920410533958</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2kyivnehkja7tkchwdca6flnqi">fatcat:2kyivnehkja7tkchwdca6flnqi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20150513234804/http://www.sysc.pdx.edu:80/download/papers/ldlpitf.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/ec/c1/ecc116c5b454d82a8e1abc1872841b0741bc7d5c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1108/03684920410533958"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

FPGA Architectures: An Overview [chapter]

Umer Farooq, Zied Marrakchi, Habib Mehrez
<span title="">2012</span> <i title="Springer New York"> Tree-based Heterogeneous FPGA Architectures </i> &nbsp;
First of all an overview of the basic FPGA architecture is presented.  ...  After that, an overview of the different steps involved in FPGA design flow is given.  ...  The circuit can also be represented by a Directed Acyclic Graph (D AG). Each node in the graph represents a gate, flip-flop, primary input or primary output.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4614-3594-5_2">doi:10.1007/978-1-4614-3594-5_2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7szci26wmfbnhnqhwdijyl4uba">fatcat:7szci26wmfbnhnqhwdijyl4uba</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170519063110/http://www.csee.usf.edu:80/~haozheng/teaching/cda4253/doc/fpga-arch-overview.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/73/d4/73d4bc40003fc010e615eb161408af4e9152b445.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4614-3594-5_2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Big mapping class groups: an overview [article]

Javier Aramayona, Nicholas G. Vlamis
<span title="2020-07-28">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
To the best of our knowledge, the first step in this direction was the paper of Greenberg-Sergiescu [56] , whose objective was to construct an acyclic extension of F , the commutator subgroup of F , by  ...  We direct the reader to their article for details.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2003.07950v3">arXiv:2003.07950v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3p7q5ep62zh4hhehonb5odzgiu">fatcat:3p7q5ep62zh4hhehonb5odzgiu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200928165151/https://arxiv.org/pdf/2003.07950v3.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/a4/4c/a44c719deb222a6dbd23f76b99235d4abd47d45f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2003.07950v3" 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>

Graph Signal Processing: Overview, Challenges and Applications [article]

Antonio Ortega, Pascal Frossard, Jelena Kovačević, José M. F. Moura, Pierre Vandergheynst
<span title="2018-03-26">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Research in Graph Signal Processing (GSP) aims to develop tools for processing data defined on irregular graph domains.  ...  In this paper we first provide an overview of core ideas in GSP and their connection to conventional digital signal processing.  ...  Acyclic graphs [31] , [32] represent Bayesian networks, and undirected graphs represent Markov random fields [33] , [34] , [35] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1712.00468v2">arXiv:1712.00468v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/56d6jkkaozhzbnyr7llwesugpi">fatcat:56d6jkkaozhzbnyr7llwesugpi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200830093408/https://arxiv.org/pdf/1712.00468v2.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/5c/2e/5c2e5cb587b21a8d9fbabfaa37a571ad243064e7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1712.00468v2" 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>

An Overview of Text Summarization

Laxmi B., P. Venkata
<span title="2017-08-24">2017</span> <i title="Foundation of Computer Science"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/b637noqf3vhmhjevdfk3h5pdsu" style="color: black;">International Journal of Computer Applications</a> </i> &nbsp;
Directed graph maintains a flow of text while an edge in undirected graph captures relation using co-occurrence of term. Tree is acyclic graph. Masaaki Nishino et al.  ...  The algorithm exploits the zero-suppressed binary decision diagram (ZDD), a data structure that accounts for a family of sets as a directed acyclic graph.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5120/ijca2017915109">doi:10.5120/ijca2017915109</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hlpvgrzpd5hord5bfy4zndqexi">fatcat:hlpvgrzpd5hord5bfy4zndqexi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180602045220/https://www.ijcaonline.org/archives/volume171/number10/rananavare-2017-ijca-915109.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/23/8a/238a834372f03bcffc281e7b21214587d48926de.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5120/ijca2017915109"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Overview of multidatabase transaction management

Yuri Breitbart, Hector Garcia-Molina, Avi Silberschatz
<span title="">2010</span> <i title="ACM Press"> CASCON First Decade High Impact Papers on - CASCON &#39;10 </i> &nbsp;
Schedule Sk is serializable if and only if its local serialization graph is acyclic (Bernstein et al., 1987) .  ...  A global schedule is globally serializable if and only if its global serialization graph is acyclic (Breitbart and Silberschatz, 1988) .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1925805.1925811">doi:10.1145/1925805.1925811</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/innvl5ohx5e5phvyltqpbk2ocu">fatcat:innvl5ohx5e5phvyltqpbk2ocu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170420151206/http://delab.csd.auth.gr:80/~dimitris/courses/mpc_fall06/papers/transactions/multi_db_transaction_processing_I.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/09/3a/093ab1eb94d4c57b869061480231a019fdc6c679.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1925805.1925811"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Overview of multidatabase transaction management

Yuri Breitbart, Hector Garcia-Molina, Avi Silberschatz
<span title="">1992</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/bj2uhzcrunglzmjsyjjm3qh4hm" style="color: black;">The VLDB journal</a> </i> &nbsp;
Schedule Sk is serializable if and only if its local serialization graph is acyclic (Bernstein et al., 1987) .  ...  A global schedule is globally serializable if and only if its global serialization graph is acyclic (Breitbart and Silberschatz, 1988) .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bf01231700">doi:10.1007/bf01231700</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2bcf7gkjdna2tlpdfd2fhi57hy">fatcat:2bcf7gkjdna2tlpdfd2fhi57hy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170420151206/http://delab.csd.auth.gr:80/~dimitris/courses/mpc_fall06/papers/transactions/multi_db_transaction_processing_I.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/09/3a/093ab1eb94d4c57b869061480231a019fdc6c679.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bf01231700"> <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,271 results