Results 21 to 30 of about 347,865 (289)
TheoretiCSWe introduce determinantal sieving, a new, remarkably powerful tool in the toolbox of algebraic FPT algorithms. Given a polynomial $P(X)$ on a set of variables $X=\{x_1,\ldots,x_n\}$ and a linear matroid $M=(X,\mathcal{I})$ of rank $k$, both over a field
Eduard Eiben +2 more
doaj +1 more source
Contention-sensitive data structures and algorithms [PDF]
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
ADVANCED DATA STRUCTURES AND ALGORITHMS
, 2023 <p>ADVANCED DATA STRUCTURES AND ALGORITHMS</p ...
Prof. Sanjay Agal
core +1 more source
An Objective Improvement Approach to Solving Discounted Payoff Games [PDF]
Logical Methods in Computer ScienceWhile discounted payoff games and classic games that reduce to them, like parity and mean-payoff games, are symmetric, their solutions are not. We have taken a fresh view on the properties that optimal solutions need to have, and devised a novel way to ...
Daniele Dell'Erba +2 more
doaj +1 more source
Approximating Queries on Probabilistic Graphs [PDF]
Logical Methods in Computer ScienceQuery evaluation over probabilistic databases is notoriously intractable -- not only in combined complexity, but often in data complexity as well. This motivates the study of approximation algorithms, and particularly of combined FPRASes, with runtime ...
Antoine Amarilli +3 more
doaj +1 more source
Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-to-Face Communication Models [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 We initiate the study of a new problem on searching and fetching in a distributed environment concerning treasure-evacuation from a unit disk. A treasure and an exit are located at unknown positions on the perimeter of a disk and at known arc distance. A
Konstantinos Georgiou +2 more
doaj +1 more source
Enumeration Algorithms for Conjunctive Queries with Projection [PDF]
Logical Methods in Computer ScienceWe investigate the enumeration of query results for an important subset of CQs with projections, namely star and path queries. The task is to design data structures and algorithms that allow for efficient enumeration with delay guarantees after a ...
Shaleen Deep, Xiao Hu, Paraschos Koutris
doaj +1 more source
Longest Gapped Repeats and Palindromes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 A gapped repeat (respectively, palindrome) occurring in a word $w$ is a factor $uvu$ (respectively, $u^Rvu$) of $w$. In such a repeat (palindrome) $u$ is called the arm of the repeat (respectively, palindrome), while $v$ is called the gap. We show how to
Marius Dumitran +2 more
doaj +1 more source
Range (Rényi) Entropy Queries and Partitioning [PDF]
Logical Methods in Computer ScienceData partitioning that maximizes/minimizes the Shannon entropy, or more generally the Rényi entropy is a crucial subroutine in data compression, columnar storage, and cardinality estimation algorithms.
Aryan Esmailpour +2 more
doaj +1 more source
FPT algorithms to recognize well covered graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Given a graph $G$, let $vc(G)$ and $vc^+(G)$ be the sizes of a minimum and a maximum minimal vertex covers of $G$, respectively. We say that $G$ is well covered if $vc(G)=vc^+(G)$ (that is, all minimal vertex covers have the same size).
Rafael Araujo +4 more
doaj +1 more source