default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 182
Volume 182, August 2023
- Mnacho Echenim, Nicolas Peltier
:
An undecidability result for Separation Logic with theory reasoning. 106359 - Abolfazl Poureidi, Jafar Fathali:
Algorithmic results in Roman dominating functions on graphs. 106363 - Zi-Yuan Liu, Yi-Fan Tseng, Raylin Tso:
Cryptanalysis of a round optimal lattice-based multisignature scheme. 106364 - Adele A. Rescigno, Ugo Vaccaro:
Bounds and algorithms for generalized superimposed codes. 106365 - Ilya Volkovich:
The final nail in the coffin of statistically-secure obfuscator. 106366 - Maithilee Patawar, Kalpesh Kapoor:
Density of distinct squares in non-primitive words. 106367 - Shu-Li Zhao, Jou-Ming Chang:
Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes. 106377 - Santiago Cifuentes, Francisco J. Soulignac, Pablo Terlisky:
Complexity of solving a system of difference constraints with variables restricted to a finite set. 106378 - Kang Li, Fengjun Xiao, Bingpeng Zhou, Jinming Wen:
A sharper lower bound on Rankin's constant. 106379 - Vincent Guingona, Alexei Kolesnikov, Julianne Nierwinski, Avery Schweitzer:
Comparing approximate and probabilistic differential privacy parameters. 106380 - Miguel Bosch Calvo, Steven Kelk:
An improved kernel for the flip distance problem on simple convex polygons. 106381 - Brian Hentschel, Peter J. Haas, Yuanyuan Tian:
Exact PPS sampling with bounded sample size. 106382 - Dishant Goyal, Ragesh Jaiswal:
Tight FPT Approximation for Socially Fair Clustering. 106383 - Fangyu Tian, Yuxue Yin:
The odd chromatic number of a toroidal graph is at most 9. 106384 - Nikolaos Fryganiotis, Symeon Papavassiliou, Christos Pelekis:
A note on the network coloring game: A randomized distributed (Δ + 1)-coloring algorithm. 106385 - Tapas Das, Tuomo Lehtilä, Soumen Nandi, Sagnik Sen, D. K. Supraja:
On radio k-labeling of the power of the infinite path. 106386 - Johannes Rauch, Dieter Rautenbach:
Efficiently recognizing graphs with equal independence and annihilation numbers. 106387 - Pasin Manurangsi, Erel Segal-Halevi, Warut Suksompong:
On maximum bipartite matching with separation. 106388 - Nikhil Bansal, John Kuszmaul, William Kuszmaul:
A nearly tight lower bound for the d-dimensional cow-path problem. 106389 - Naoyuki Kamiyama:
On optimization problems in acyclic hypergraphs. 106390 - Konstantinos Georgiou, Evangelos Kranakis, Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou:
Optimal circle search despite the presence of faulty robots. 106391 - Nathalie Bertrand, Hugo Francon, Nicolas Markey:
Synchronizing words under LTL constraints. 106392 - Canh V. Pham, Dung K. Ha:
A note for approximating the submodular cover problem over integer lattice with low adaptive and query complexities. 106393 - Leo van Iersel, Vincent Moulton, Yukihiro Murakami:
Polynomial invariants for cactuses. 106394 - José Luis Imaña, Siemen Dhooghe:
Domain-oriented masked bit-parallel finite-field multiplier against side-channel attacks. 106395 - Sahar Diskin, Dor Elboim:
Heavy and light paths and Hamilton cycles. 106396 - Michael B. Dillencourt, Michael T. Goodrich:
Simplified Chernoff bounds with powers-of-two probabilities. 106397 - Hideo Bannai, Tomohiro I, Dominik Köppl:
Longest bordered and periodic subsequences. 106398 - Hao Wu, Huan Long:
Probabilistic weak bisimulation and axiomatization for probabilistic models. 106399 - Yilun Shang:
Long paths in heterogeneous random subgraphs of graphs with large minimum degree. 106401 - Hossein Jowhari, Mohsen Rezapour:
Monochromatic partitioning of colored points by lines. 106402 - Daniel Misselbeck-Wessel:
Maximal elements with minimal logic. 106403
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 2024-11-04 20:45 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:
