Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Gunther, W.
and
Drechsler, R.
2001.
Implementation of read-k-times BDDs on top of standard BDD packages.
p.
173.
Kerntopf, P.
2001.
An approach to minimization of decision diagrams.
p.
79.
Sawitzki, Daniel
2007.
Lower bounds on the OBDD size of two fundamental functions' graphs.
Information Processing Letters,
Vol. 101,
Issue. 2,
p.
66.
Bollig, Beate
2010.
Combinatorial Optimization and Applications.
Vol. 6509,
Issue. ,
p.
16.
Bollig, Beate
2010.
Theoretical Computer Science.
Vol. 323,
Issue. ,
p.
286.
Bollig, Beate
2012.
On symbolic OBDD-based algorithms for the minimum spanning tree problem.
Theoretical Computer Science,
Vol. 447,
Issue. ,
p.
2.
Jegier, Jerzy
Kerntopf, Pawel
and
Szyprowski, Marek
2013.
An approach to constructing reversible multi-qubit benchmarks with provably minimal implementations.
p.
99.
Bollig, Beate
and
Capelle, Michael
2013.
Priority functions for the approximation of the metric TSP.
Information Processing Letters,
Vol. 113,
Issue. 14-16,
p.
584.
Saeedi, Mehdi
and
Markov, Igor L.
2013.
Synthesis and optimization of reversible circuits—a survey.
ACM Computing Surveys,
Vol. 45,
Issue. 2,
p.
1.
Bollig, Beate
and
Pröger, Tobias
2014.
On efficient implicit OBDD-based algorithms for maximal matchings.
Information and Computation,
Vol. 239,
Issue. ,
p.
29.
Bollig, Beate
2014.
Mathematical Foundations of Computer Science 2014.
Vol. 8635,
Issue. ,
p.
118.
Wang, Qichun
and
Tan, Chik How
2016.
On the second-order nonlinearity of the hidden weighted bit function.
Discrete Applied Mathematics,
Vol. 215,
Issue. ,
p.
197.
Kerntopf, Pawel
Podlaski, Krzysztof
Moraga, Claudio
and
Stankovic, Radomir S.
2017.
Study of Reversible Ternary Functions with Homogeneous Component Functions.
p.
191.
Pasalic, Enes
Chattopadhyay, Anupam
and
Zhang, WeiGuo
2017.
Efficient implementation of generalized Maiorana–McFarland class of cryptographic functions.
Journal of Cryptographic Engineering,
Vol. 7,
Issue. 4,
p.
287.
Bollig, Beate
and
Buttkus, Matthias
2019.
On the Relative Succinctness of Sentential Decision Diagrams.
Theory of Computing Systems,
Vol. 63,
Issue. 6,
p.
1250.
Amii, Kei
Nishino, Masaaki
and
Yamamoto, Akihiro
2019.
On Representing the Set of All Parse Trees with a Decision Diagram.
Transactions of the Japanese Society for Artificial Intelligence,
Vol. 34,
Issue. 6,
p.
A-I34_1.
Bollig, Beate
and
Buttkus, Matthias
2020.
On Limitations of Structured (Deterministic) DNNFs.
Theory of Computing Systems,
Vol. 64,
Issue. 5,
p.
799.
Mull, Nathan
Pang, Shuo
and
Razborov, Alexander
2022.
On CDCL-Based Proof Systems with the Ordered Decision Strategy.
SIAM Journal on Computing,
Vol. 51,
Issue. 4,
p.
1368.
Bravyi, Sergey
Yoder, Theodore J.
and
Maslov, Dmitri
2022.
Efficient Ancilla-Free Reversible and Quantum Circuits for the Hidden Weighted Bit Function.
IEEE Transactions on Computers,
Vol. 71,
Issue. 5,
p.
1170.
Li, Yongshang
Zhang, Yu
Chen, Mingyu
Li, Xiangyang
and
Xu, Peng
2023.
Timing-Aware Qubit Mapping and Gate Scheduling Adapted to Neutral Atom Quantum Computing.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems,
Vol. 42,
Issue. 11,
p.
3768.