default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 1071
Volume 1071, 2026
- Zsuzsanna Lipták
, Francesco Masillo, Simon J. Puglisi:
Matching statistics - a survey. 115796 - Lingyuan Ye:
Categorical structure in coherent theory of arithmetic. 115832 - Victorien Desbois, Ocan Sankur, François Schwarzentruber:
Linear Planar 3-SAT. 115834 - Giovanni Pighizzini:
Push complexity: Optimal bounds and decidability. 115839 - Luisa Herrmann, Richard Mörbitz:
Global one-counter tree automata. 115840 - Ying Gao, Xinrui Yang, Jie Chen, Yijian Zhang, Yu Li:
Matchmaking encryption for NC1 circuits without obfuscation. 115841 - Aaron Barnoff, Curtis Bright, Jeffrey O. Shallit:
Computing the base-b representation of quadratic irrationals using automata. 115843 - Fang Kong, Xiaoxi Zhang, Xiao Huang, Lijun Zhang, Shuai Li:
Bandit learning in matching markets with relative feedback. 115846 - Jinting Bian, Hans-Dieter A. Hiep, Frank S. de Boer:
History-based reasoning about behavioral subtyping (extended paper). 115847 - Abbass Gorgi, Adnane Fouadi, Bousselham Ganbouri, Mourad El Ouali:
A hybrid algorithm based on a multiple randomized rounding for set multicover problem: Approximation guarantees and experiments. 115849 - Dariusz Dereniowski, Izajasz P. Wrosz:
Searching in trees with monotonic query times. 115850 - Colin Krisko, Avery Miller:
Labeling schemes for deterministic radio multi-broadcast. 115857 - Tristram Bogart, Juan Andrés Valero:
Bounds on determinantal complexity of two types of generalized permanents. 115862 - Xiaohui Hua, Yaji Lin:
The h-extra r-component edge connectivity of star networks. 115863
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 2026-08-29 00:16 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
