Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 440 matches
- 2024
- Ahmadi Hasan, Ahmad Kamal:
Community detection of weighted complex networks via transitive closure. Computing 106(3): 961-979 (2024) - 2023
- Anupam Das, Marianna Girlando:
Cyclic Hypersequent System for Transitive Closure Logic. J. Autom. Reason. 67(3): 27 (2023) - Xiantian Zhou, Abir Farouzi, Ladjel Bellatreche, Carlos Ordonez:
Bitwise Algorithms to Compute the Transitive Closure of Graphs in Python. DEXA (1) 2023: 345-351 - Yoshiki Nakamura:
Existential Calculi of Relations with Transitive Closure: Complexity and Edge Saturations. LICS 2023: 1-13 - David Berthelot, Arnaud Autef, Jierui Lin, Dian Ang Yap, Shuangfei Zhai, Siyuan Hu, Daniel Zheng, Walter Talbott, Eric Gu:
TRACT: Denoising Diffusion Models with Transitive Closure Time-Distillation. CoRR abs/2303.04248 (2023) - Yoshiki Nakamura:
Existential Calculi of Relations with Transitive Closure: Complexity and Edge Saturations. CoRR abs/2304.12079 (2023) - Luiz F. Afra Brito, Marcelo Keese Albertini, Bruno A. N. Travençolo:
A Dynamic Data Structure for Representing Timed Transitive Closures on Disk. CoRR abs/2306.13937 (2023) - 2022
- Yousef Al-Qudah, Khaleed Alhazaymeh, Nasruddin Hassan, Hamza Qoqazeh, Mohammad Almousa, Mohammad Alaroud:
Transitive Closure of Vague Soft Set Relations and its Operators. Int. J. Fuzzy Log. Intell. Syst. 22(1): 59-68 (2022) - Mahdi Niknam, Behrouz Minaei-Bidgoli, Rouhollah Dianat:
The role of transitive closure in evaluating blocking methods for dirty entity resolution. J. Intell. Inf. Syst. 58(3): 561-590 (2022) - Anupam Das, Marianna Girlando:
Cyclic Proofs, Hypersequents, and Transitive Closure Logic. IJCAR 2022: 509-528 - Yang Hsu, Min-Hsuan Chung, Yao-Wen Chang, Ci-Hong Lin:
Transitive Closure Graph-Based Warpage-Aware Floorplanning for Package Designs. ICCAD 2022: 16:1-16:7 - Inju Na, Yang-Sae Moon, Ilyeop Yi, Kyu-Young Whang, Soon J. Hyun:
Regular Path Query Evaluation Sharing a Reduced Transitive Closure Based on Graph Reduction. ICDE 2022: 1675-1686 - Piero A. Bonatti, Luigi Sauro:
Sticky Policies in OWL2: Extending PL with Fixpoints and Transitive Closure. KR 2022 - Kenny Ballou, Elena Sherman:
Incremental Transitive Closure for Zonal Abstract Domain. NFM 2022: 800-808 - Anupam Das, Marianna Girlando:
Cyclic Proofs, Hypersequents, and Transitive Closure Logic. CoRR abs/2205.08616 (2022) - 2021
- Xiaozhe Li, Xuan Wang, Junfeng Zhou, Ming Du:
buTCS: An Optimized Algorithm for Estimating the Size of Transitive Closure. IEEE Access 9: 116528-116539 (2021) - Lemnaouar Zedam, Bernard De Baets:
Transitive Closures of Ternary Fuzzy Relations. Int. J. Comput. Intell. Syst. 14(1): 1784-1795 (2021) - Sarthak Patel, Bhrugu Dave, Smit Kumbhani, Mihir Desai, Sidharth Kumar, Bhaskar Chaudhury:
Scalable parallel algorithm for fast computation of Transitive Closure of Graphs on Shared Memory Architectures. ESPM2@SC 2021: 1-9 - Oded Green, Zhihui Du, Sanyamee Patel, Zehui Xie, Hang Liu, David A. Bader:
Anti-Section Transitive Closure. HiPC 2021: 192-201 - Inju Na, Ilyeop Yi, Kyu-Young Whang, Yang-Sae Moon, Soon J. Hyun:
Regular Path Query Evaluation Sharing a Reduced Transitive Closure Based on Graph Reduction. CoRR abs/2111.06918 (2021) - 2020
- Jelle Hellings, Marc Gyssens, Yuqing Wu, Dirk Van Gucht, Jan Van den Bussche, Stijn Vansummeren, George H. L. Fletcher:
Comparing the expressiveness of downward fragments of the relation algebra with transitive closure on trees. Inf. Syst. 89: 101467 (2020) - Sabria Farheen, Nancy A. Day, Amirhossein Vakili, Ali Abbassi:
Transitive-closure-based model checking (TCMC) in Alloy. Softw. Syst. Model. 19(3): 721-740 (2020) - Yangjun Chen, Bin Guo, Xingyue Huang:
δ-Transitive closures and triangle consistency checking: a new way to evaluate graph pattern queries in large graph databases. J. Supercomput. 76(10): 8140-8174 (2020) - Liron Cohen, Reuben N. S. Rowe:
Non-well-founded Proof Theory of Transitive Closure Logic. ACM Trans. Comput. Log. 21(4): 31:1-31:31 (2020) - Stanislav Kikot, Ilya Shapirovsky, Evgeny Zolin:
Modal Logics with Transitive Closure: Completeness, Decidability, Filtration. AiML 2020: 369-388 - Lian He, Zhenxin Zhao, Yuanzhu Chen, Lihong Zhang:
Advanced Transitive-Closure-Graph-Based Placement Representation for Analog Layout Design. ICECS 2020: 1-4 - Jean Christoph Jung, Carsten Lutz, Thomas Zeume:
On the Decidability of Expressive Description Logics with Transitive Closure and Regular Role Expressions. KR 2020: 529-538 - Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Faster Fully Dynamic Transitive Closure in Practice. SEA 2020: 14:1-14:14 - Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Faster Fully Dynamic Transitive Closure in Practice. CoRR abs/2002.00813 (2020) - 2019
- Xian Tang, Ziyang Chen, Kai Li, Xiang Liu:
Efficient computation of the transitive closure size. Clust. Comput. 22(Supplement): 6517-6527 (2019)
skipping 410 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-04-24 06:20 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint