default search action
Acta Informatica, Volume 61
Volume 61, Number 1, March 2024
- Tonatiuh Tapia-Flores, Ernesto López-Mellado:
Discovering workflow nets of concurrent iterative processes. 1-21 - Hao Wu, Yu-Fang Chen, Zhilin Wu, Bican Xia, Naijun Zhan:
A decision procedure for string constraints with string/integer conversion and flat regular constraints. 23-52 - Shuyang Gao, Leen Hatem, Hosam M. Mahmoud:
Balancing m-ary search trees with compressions on the fringe. 53-66 - Haiyan Liu, Rongdong Cui, Tianjie Zhang:
n-PS-codes, 2-infix-outfix codes and some related classes of codes. 67-81 - Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada:
Neighborhood mutual remainder: self-stabilizing distributed implementation and applications. 83-100
Volume 61, Number 2, June 2024
- Giannis Alonistiotis
, Antonis Antonopoulos
Approximating subset sum ratio via partition computations. 101-113 - Cahit Dede:
New families of Laplacian borderenergetic graphs. 115-129 - Hao Li, Daowen Qiu, Le Luo, Paulo Mateus
Exact distributed quantum algorithm for generalized Simon's problem. 131-159 - Attila Bagossy, Péter Battyányi
An encoding of the λ-calculus in the String MultiSet Rewriting calculus. 161-181 - Gang Yang, Jiannan Zhou, Changxiang He, Yaping Mao:
Distance-edge-monitoring sets of networks. 183-198
Volume 61, Number 3, September 2024
- Kamaledin Ghiasi-Shirazi
Revisiting 2-3 red-black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking. 199-229 - Shiping Chen, Xinyu Ge:
Reachability analysis of linear systems. 231-260 - Wided Ghardallou, Hessamaldin Mohammadi, Richard C. Linger, Mark G. Pleszkoch, Ji Meng Loh, Ali Mili
Invariant relations for affine loops. 261-314 - Wenfeng Lai, Adiesha Liyanage, Binhai Zhu, Peng Zou:
The longest letter-duplicated subsequence and related problems. 315-329
Volume 61, Number 4, December 2024
- Henning Fernau:
Editorial 2024: moving forwards in the electronic age. 331-332 - Burkay Sucu, Ebru Aydin Gol:
Cycle encoding-based parameter synthesis for timed automata safety. 333-356 - R. Mahendra Kumar, N. Sadagopan:
A closer look at Hamiltonicity and domination through the lens of diameter and convexity. 357-382 - Pamela Fleischmann, Lukas Haschke, Tim Löck, Dirk Nowotka:
Word-representable graphs from a word's perspective. 383-400 - Koustav De
Parameterized aspects of distinct Kemeny rank aggregation. 401-414 - Davaajav Jargalsaikhan, Diptarama Hendrian, Yohei Ueki, Ryo Yoshinaka, Ayumi Shinohara:
Serial and parallel algorithms for order-preserving pattern matching based on the duel-and-sweep paradigm. 415-444 - Shunsuke Inenaga:
Linear-size suffix tries and linear-size CDAWGs simplified and improved. 445-468
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-12-22 18:48 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: