Solving the constant-degree parallelism alignment problem

被引:0
|
作者
Diderich, Claude G.
Gengler, Marc
机构
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [1] A heuristic approach for finding a solution to the constant-degree parallelism alignment problem
    Diderich, CG
    Gengler, M
    PROCEEDINGS OF THE 1996 CONFERENCE ON PARALLEL ARCHITECTURES AND COMPILATION TECHNIQUES (PACT '96), 1996, : 127 - 132
  • [2] An Elementary Construction of Constant-Degree Expanders
    Alon, Noga
    Schwartz, Oded
    Shapira, Asaf
    PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 454 - +
  • [3] An elementary construction of constant-degree expanders
    Alon, Noga
    Schwartz, Oded
    Shapira, Asaf
    COMBINATORICS PROBABILITY & COMPUTING, 2008, 17 (03): : 319 - 327
  • [4] New Explicit Constant-Degree Lossless Expanders
    Golowich, Louis
    PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 4963 - 4971
  • [5] Randomness conductors and constant-degree lossless expanders
    Capalbo, M
    Reingold, O
    Vadhan, S
    Wigderson, A
    17TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2002, : 15 - 15
  • [6] Constant-Degree Graph Expansions that Preserve Treewidth
    Markov, Igor L.
    Shi, Yaoyun
    ALGORITHMICA, 2011, 59 (04) : 461 - 470
  • [7] Constant-Degree Graph Expansions that Preserve Treewidth
    Igor L. Markov
    Yaoyun Shi
    Algorithmica, 2011, 59 : 461 - 470
  • [8] Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
    Lin, Huijia
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2016, PT I, 2016, 9665 : 28 - 57
  • [9] Constant-rate interactive coding is impossible, even in constant-degree networks
    2017, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing (67):
  • [10] Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings
    Pass, Rafael
    Shelat, Abhi
    THEORY OF CRYPTOGRAPHY, TCC 2016-A, PT I, 2016, 9562 : 3 - 17