The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Markus Püschel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sung-Chul Han, Franz Franchetti, Markus Püschel
    Program generation for the all-pairs shortest path problem. [Citation Graph (0, 0)][DBLP]
    PACT, 2006, pp:222-232 [Conf]
  2. Markus Püschel, Martin Rötteler, Thomas Beth
    Fast Quantum Fourier Transforms for a Class of Non-Abelian Groups. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:148-159 [Conf]
  3. Claire Fang Fang, Rob A. Rutenbar, Markus Püschel, Tsuhan Chen
    Toward efficient static analysis of finite-precision effects in DSP applications via affine arithmetic modeling. [Citation Graph (0, 0)][DBLP]
    DAC, 2003, pp:496-501 [Conf]
  4. Grace Nordin, Peter A. Milder, James C. Hoe, Markus Püschel
    Automatic generation of customized discrete fourier transform IPs. [Citation Graph (0, 0)][DBLP]
    DAC, 2005, pp:471-474 [Conf]
  5. Peter Tummeltshammer, James C. Hoe, Markus Püschel
    Multiple constant multiplication by time-multiplexed mapping of addition chains. [Citation Graph (0, 0)][DBLP]
    DAC, 2004, pp:826-829 [Conf]
  6. Markus Püschel, Jelena Kovacevic
    Real, Tight Frames with Maximal Robustness to Erasures. [Citation Graph (0, 0)][DBLP]
    DCC, 2005, pp:63-72 [Conf]
  7. Peter A. Milder, Mohammad Ahmad, James C. Hoe, Markus Püschel
    Fast and accurate resource estimation of automatically generated custom DFT IP cores. [Citation Graph (0, 0)][DBLP]
    FPGA, 2006, pp:211-220 [Conf]
  8. Markus Püschel, Bryan Singer, Manuela M. Veloso, José M. F. Moura
    Fast Automatic Generation of DSP Algorithms. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (1), 2001, pp:97-106 [Conf]
  9. Markus Püschel, A. C. Zelinski, James C. Hoe
    Custom-optimized multiplierless implementations of DSP algorithms. [Citation Graph (0, 0)][DBLP]
    ICCAD, 2004, pp:175-182 [Conf]
  10. Markus Püschel, Martin Rötteler
    Fourier transform for the spatial quincunx lattice. [Citation Graph (0, 0)][DBLP]
    ICIP (2), 2005, pp:494-497 [Conf]
  11. Franz Franchetti, Markus Püschel
    A SIMD Vectorizing Compiler for Digital Signal Processing Algorithms. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2002, pp:- [Conf]
  12. Franz Franchetti, Markus Püschel
    Short Vector Code Generation for the Discrete Fourier Transform. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:58- [Conf]
  13. Andreas Bonelli, Franz Franchetti, Juergen Lorenz, Markus Püschel, Christoph W. Ueberhuber
    Automatic Performance Optimization of the Discrete Fourier Transform on Distributed Memory Computers. [Citation Graph (0, 0)][DBLP]
    ISPA, 2006, pp:818-832 [Conf]
  14. Sebastian Egner, Markus Püschel
    Solving Puzzles Related to Permutation Groups. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1998, pp:186-193 [Conf]
  15. Sebastian Egner, Markus Püschel, Thomas Beth
    Decomposing a Permutation into a Conjugated Tensor Product. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1997, pp:101-108 [Conf]
  16. Franz Franchetti, Yevgen Voronenko, Markus Püschel
    Formal loop merging for signal transforms. [Citation Graph (0, 0)][DBLP]
    PLDI, 2005, pp:315-326 [Conf]
  17. Franz Franchetti, Yevgen Voronenko, Markus Püschel
    Tools and techniques for performance - FFT program generation for shared memory: SMP and multicore. [Citation Graph (0, 0)][DBLP]
    SC, 2006, pp:115- [Conf]
  18. Franz Franchetti, Stefan Kral, Juergen Lorenz, Markus Püschel, Christoph W. Ueberhuber
    Automatically Tuned FFTs for BlueGene/L's Double FPU. [Citation Graph (0, 0)][DBLP]
    VECPAR, 2004, pp:23-36 [Conf]
  19. Sebastian Egner, Markus Püschel
    Symmetry-based matrix factorization. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2004, v:37, n:2, pp:157-186 [Journal]
  20. Jeremy R. Johnson, José M. F. Moura, Markus Püschel, Daniel N. Rockmore
    Special issue on computer algebra and signal processing: forward by the guest editors. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2004, v:37, n:2, pp:133-135 [Journal]
  21. Markus Püschel
    Decomposing Monomial Representations of Solvable Groups. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2002, v:34, n:6, pp:561-596 [Journal]
  22. Markus Püschel, José M. F. Moura
    The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:5, pp:1280-1316 [Journal]
  23. Paolo D'Alberto, Markus Püschel, Franz Franchetti
    Performance/Energy Optimization of DSP Transforms on the XScale Processor. [Citation Graph (0, 0)][DBLP]
    HiPEAC, 2007, pp:201-214 [Conf]
  24. Franz Franchetti, Yevgen Voronenko, Markus Püschel
    A Rewriting System for the Vectorization of Signal Transforms. [Citation Graph (0, 0)][DBLP]
    VECPAR, 2006, pp:363-377 [Conf]
  25. Markus Püschel, José M. F. Moura
    Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  26. Markus Püschel, José M. F. Moura
    Algebraic Signal Processing Theory [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  27. Yevgen Voronenko, Markus Püschel
    Multiplierless multiple constant multiplication. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:2, pp:- [Journal]
  28. Markus Püschel, Martin Rötteler
    Algebraic Signal Processing Theory: 2-D Spatial Hexagonal Lattice. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Image Processing, 2007, v:16, n:6, pp:1506-1521 [Journal]

  29. Automatic Tuning of Discrete Fourier Transforms Driven by Analytical Modeling. [Citation Graph (, )][DBLP]


  30. System Demonstration of Spiral: Generator for High-Performance Linear Transform Libraries. [Citation Graph (, )][DBLP]


  31. Generating SIMD Vectorized Permutations. [Citation Graph (, )][DBLP]


  32. Computer Generation of General Size Linear Transform Libraries. [Citation Graph (, )][DBLP]


  33. Formal datapath representation and manipulation for implementing DSP transforms. [Citation Graph (, )][DBLP]


  34. Automatic generation of streaming datapaths for arbitrary fixed permutations. [Citation Graph (, )][DBLP]


  35. Operator Language: A Program Generation Framework for Fast Kernels. [Citation Graph (, )][DBLP]


  36. Generating FPGA-Accelerated DFT Libraries. [Citation Graph (, )][DBLP]


  37. Can we teach computers to write fast libraries? [Citation Graph (, )][DBLP]


  38. Computer Generation of Efficient Software Viterbi Decoders. [Citation Graph (, )][DBLP]


  39. An Adaptive Multiresolution Approach to Fingerprint Recognition. [Citation Graph (, )][DBLP]


  40. Bandit-based optimization on graphs with application to library performance tuning. [Citation Graph (, )][DBLP]


  41. Computer generation of fast fourier transforms for the cell broadband engine. [Citation Graph (, )][DBLP]


  42. Domain-specific library generation for parallel software and hardware platforms. [Citation Graph (, )][DBLP]


  43. Axonal bouton modeling, detection and distribution analysis for the study of neural circuit organization and plasticity. [Citation Graph (, )][DBLP]


  44. Automatic synthesis of high performance mathematical programs. [Citation Graph (, )][DBLP]


  45. How to Write Fast Numerical Code: A Small Introduction. [Citation Graph (, )][DBLP]


  46. Haar filter banks for I-D space signals. [Citation Graph (, )][DBLP]


  47. Alternatives to the discrete fourier transform. [Citation Graph (, )][DBLP]


  48. Generating high performance pruned FFT implementations. [Citation Graph (, )][DBLP]


  49. Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice. [Citation Graph (, )][DBLP]


  50. Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for Polynomial Transforms Based on Induction [Citation Graph (, )][DBLP]


Search in 0.147secs, Finished in 0.150secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002