Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Flexible tree-search based orthogonal matching pursuit algorithm.

G. Karabulut, L. Moura, D. Panario, and A. Yongaçoglu. ICASSP (4), page 673-676. IEEE, (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Daniel Holder University of Stuttgart

Laser micromachining of bionic transport structures on cemented tungsten carbide for passive directional transport of lubricantsD. Holder, N. Kessenbrock, K. Cirakoglu, C. Hagenlocher, and T. Graf. 123, page 452–457. Elsevier BV, (2024)

Dr. -Ing. Daniel Markthaler University of Stuttgart

Replication Data for: Biocatalytic stereocontrolled head-to-tail cyclizations of unbiased terpenes as a tool in chemoenzymatic synthesisN. Hansen, and D. Markthaler. Dataset, (2024)Related to: Schneider, Andreas; Lystbæk, Thomas B.; Markthaler, Daniel; Hansen, Niels; Hauer, Bernhard (2024): Biocatalytic stereocontrolled head-to-tail cyclizations of unbiased terpenes as a tool in chemoenzymatic synthesis. In: Nature Communications, 15, 4925. doi: 10.1038/s41467-024-48993-9.

Univ. -Prof. Dr. Daniel Weiskopf University of Stuttgart

Supplemental Materials for: Visual Analysis of Fitness Landscapes in Architectural Design OptimizationM. Abdelaal, M. Galuschka, M. Zorn, F. Kannenberg, A. Menges, T. Wortmann, D. Weiskopf, and K. Kurzhals. Software, (2024)Related to: Manuscript accepted for publication in the Visual Computer journal.

Daniel Marino

Daniel Roth

Other publications of authors with the same name

Asymptotics of combinatorial structures with large smallest component.E. Bender, A. Mashatan, D. Panario, and L. Richmond. J. Comb. Theory, Ser. A, 107 (1): 117-125 (2004)Ambiguity and Deficiency in Costas Arrays and APN Permutations.D. Panario, B. Stevens, and Q. Wang. LATIN, volume 6034 of Lecture Notes in Computer Science, page 397-406. Springer, (2010)Ambiguity and deficiency of permutations from finite fields.D. Panario, A. Sakzad, B. Stevens, and Q. Wang. ITW, page 165-169. IEEE, (2011)Nonlinear vectorial primitive recursive sequences.S. Hasan, D. Panario, and Q. Wang. Cryptography and Communications, 10 (6): 1075-1090 (2018)The Number of Permutation Binomials over F4p+1 where p and 4p+1 are Primes.A. Masuda, D. Panario, and Q. Wang. Electr. J. Comb., (2006)A new class of irreducible pentanomials for polynomial-based multipliers in binary fields.G. Banegas, R. Custódio, and D. Panario. J. Cryptographic Engineering, 9 (4): 359-373 (2019)What Do Random Polynomials over Finite Fields Look Like?D. Panario. International Conference on Finite Fields and Applications, volume 2948 of Lecture Notes in Computer Science, page 89-108. Springer, (2003)Low density parity check lattices based on construction D' and cycle-free Tanner graphs.M. Sadeghi, and D. Panario. Algebraic Coding Theory and Information Theory, volume 68 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 85-90. DIMACS/AMS, (2003)Periods of Iterations of Mappings over Finite Fields with Restricted Preimage Sizes.R. Martins, D. Panario, C. Qureshi, and E. Schmutz. AofA, volume 110 of LIPIcs, page 30:1-30:11. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Unicyclic Strong Permutations.C. Gravel, D. Panario, and D. Thomson. CoRR, (2018)