default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 188
Volume 188, 2025
- Martin Zimmermann:
Robust probabilistic temporal logics. 106522 - Grzegorz Gluch, Krzysztof Lorys
:
4/3 rectangle tiling lower bound. 106523 - Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep:
Algorithms for subgraph complementation to some classes of graphs. 106530 - George Giakkoupis, Volker Turau, Isabella Ziccardi:
Luby's MIS algorithms made self-stabilizing. 106531 - Zeev Nutov:
A 22k-approximation algorithm for minimum power k edge disjoint st-paths. 106532 - Shabana A. T., Alphy George, S. Sheerazuddin:
Counter abstraction for regular open teams. 106533 - Rosa Wolf, Klaus Heeger, André Nichterlein:
Effective data reduction for strongly stable matching in very sparse graphs. 106534 - Haoxuan Wu, Jincheng Zhuang:
Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method. 106535 - Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi:
An improved spectral lower bound of treewidth. 106536 - Samuel Hartman, Jonathan P. Sorenson:
Reducing the space used by the sieve of Eratosthenes when factoring. 106537 - Hossein Jowhari, Shamisa Nematollahi:
Airports and railways with unsplittable demand. 106538 - Roberto Colomboni, Emmanuel Esposito, Andrea Paudice:
An improved uniform convergence bound with fat-shattering dimension. 106539 - Sergey Bereg, José Miguel Díaz-Báñez, Alina Kasiuk, Miguel Angel Pérez-Cutiño, Fabio Rodríguez:
Covering segments on a line with drones. 106540 - Peter Kostolányi:
Free products of semigroups and monoids with a deterministic context-free word problem. 106541
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-26 00:54 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:
