Results 261 to 270 of about 1,420,577 (310)
Some of the next articles are maybe not open access.
Testing Generalised Freeness of Words
Symposium on Theoretical Aspects of Computer Science, 2014Pseudo-repetitions are a natural generalisation of the classical notion of repetitions in sequences: they are the repeated concatenation of a word and its encoding under a certain morphism or antimorphism (anti-/morphism, for short).
Paweł Gawrychowski +2 more
semanticscholar +1 more source
The Constraint Satisfaction Problem, 2017
A backdoor set of a CSP instance is a set of variables whose instantiation moves the instance into a fixed class of tractable instances (an island of tractability).
Serge Gaspers +2 more
semanticscholar +1 more source
A backdoor set of a CSP instance is a set of variables whose instantiation moves the instance into a fixed class of tractable instances (an island of tractability).
Serge Gaspers +2 more
semanticscholar +1 more source
Engineering External Memory LCP Array Construction: Parallel, In-Place and Large Alphabet
The Sea, 2017The suffix array augmented with the LCP array is perhaps the most important data structure in modern string processing. There has been a lot of recent research activity on constructing these arrays in external memory.
Juha Kärkkäinen, Dominik Kempa
semanticscholar +1 more source
Voronoi Diagrams for Parallel Halflines and Line Segments in Space
International Symposium on Algorithms and Computation, 2017We consider the Euclidean Voronoi diagram for a set of n parallel halflines in R3. A relation of this diagram to planar power diagrams is shown, and is used to analyze its geometric and topological properties.
F. Aurenhammer +2 more
semanticscholar +1 more source
Erratum: Approximating Minimum-Cost Connectivity Problems via Uncrossable Bifamilies
ACM Trans. Algorithms, 2018There are two errors in our paper “Approximating minimum-cost connectivity problems via un-crossable bifamilies” (ACM Transactions on Algorithms (TALG), 9(1), Article No. 1, 2012).
Zeev Nutov
semanticscholar +1 more source
Fully Dynamic Connectivity Oracles under General Vertex Updates
International Symposium on Algorithms and Computation, 2017We study the following dynamic graph problem: given an undirected graph G, we maintain a connectivity oracle between any two vertices in G under any on-line sequence of vertex deletions and insertions with incident edges.
Kengo Nakamura
semanticscholar +1 more source
Journal of Materials Science: Materials in Electronics, 2023
Xiuhua Gao +3 more
semanticscholar +1 more source
Xiuhua Gao +3 more
semanticscholar +1 more source
A 1.6-2.2 GHz Continuous Class-F Power Amplifier with Compact Harmonically Controlled Networks
, 2022 Shinichi Tanaka, Eri Tsuji
openalex +1 more source