default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 784
Volume 784, September 2019
- Marco Budinich
:
The Boolean SATisfiability Problem in Clifford algebra. 1-10 - Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani:
On 3D visibility representations of graphs with few crossings per edge. 11-20 - Aixia Liu, Shiying Wang, Jun Yuan, Xue Ma:
The h-extra connectivity of k-ary n-cubes. 21-45 - T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu, Chenzi Zhang:
Diffusion operator and spectral analysis for directed hypergraph Laplacian. 46-64 - Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang:
A two-stages tree-searching algorithm for finding three completely independent spanning trees. 65-74 - Paul Balister, Stefanie Gerke:
The asymptotic number of prefix normal words. 75-80 - Lukasz Merta:
Composition inverses of the variations of the Baum-Sweet sequence. 81-98 - Mouhammad Said, Jacques-Olivier Lachaud:
Analytical description of digital intersections: Minimal parameters and multiscale representation. 99-112 - Bogumil Kaminski, Tomasz Olczak, Pawel Pralat:
Parallel execution of schedules with random dependency graph. 113-132 - Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira:
Approximability of covering cells with line segments. 133-141
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.
last updated on 2025-12-05 22:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
