Suchergebnisse - coding (algorithmics OR (algorithmsssic OR Algorithms))

Andere Suchmöglichkeiten:

  1. 101

    Parameterized Complexity of Efficient Sortation von Ganian, Robert, Hoang, Hung P., Wietheger, Simon

    Veröffentlicht 2024
    Inhaltsangabe: “… utilize Ramsey-type arguments and color-coding techniques to obtain parameterized algorithms for both …”
    Volltext
    Preprint
  2. 102

    HART: A Hybrid Addressing Scheme for Self-Balancing Binary Search Trees in Phase Change Memory (PCM) von Desai, Mahek, Rumale, Apoorva, Asadinia, Marjan

    Veröffentlicht 2025
    Inhaltsangabe: “… access times, and zero leakage power. However, current memory-intensive algorithms, especially those used …”
    Volltext
    Preprint
  3. 103

    MagnifierSketch: Quantile Estimation Centered at One Point von Guo, Jiarui, Lyu, Qiushi, Wu, Yuhan, Li, Haoyu, Yao, Zhaoqian, Dong, Yuqi, Wang, Xiaolin, Cui, Bin, Yang, Tong

    Veröffentlicht 2025
    Inhaltsangabe: “… arbitrary quantile estimation. However, existing algorithms are not specially designed for per-key …”
    Volltext
    Preprint
  4. 104

    Interactive Coding with Unbounded Noise von Fargion, Eden, Gelles, Ran, Gupta, Meghal

    Veröffentlicht 2024
    Inhaltsangabe: “… Interactive coding allows two parties to conduct a distributed computation despite noise corrupting …”
    Volltext
    Preprint
  5. 105

    Upper Bounds for Linear Graph Codes von Leo Versteegen

    Veröffentlicht 2024
    Inhaltsangabe: “… Upper Bounds for Linear Graph Codes Leo Versteegen Random Structures & Algorithms ABSTRACTA linear …”
    Volltext
    Artículo Open Access
  6. 106

    Optimal Testing of Reed-Muller Codes with an Online Adversary von Kelman, Esty, Meir, Uri, Zheng, Kai Zhe

    Veröffentlicht 2026
    Inhaltsangabe: “… } for Reed-Muller codes. The task in Reed-Muller testing is to determine whether an input function $f: \F^n …”
    Volltext
    Preprint
  7. 107

    Ultra-Resilient Superimposed Codes: Near-Optimal Construction and Applications von De Marco, Gianluca, Kowalski, Dariusz R.

    Veröffentlicht 2025
    Inhaltsangabe: “… A superimposed code is a collection of binary vectors (codewords) with the property that no vector …”
    Volltext
    Preprint
  8. 108

    Connectivity Labeling Schemes for Edge and Vertex Faults via Expander Hierarchies von Long, Yaowei, Pettie, Seth, Saranurak, Thatchaphol

    Veröffentlicht 2024
    Inhaltsangabe: “… uses an improved edge-expander hierarchy and a distributed coding technique based on Reed-Solomon codes …”
    Volltext
    Preprint
  9. 109

    Numerical treatment of cosserat based rate independent strain gradient plasticity theories von Juan David Gómez C.

    Veröffentlicht 2008
    Inhaltsangabe: “… David Gómez C. Ingeniería Non couple stress theory constitutive modeling integration algorithms finite …”
    Volltext
    Artículo científico
  10. 110

    The Probability That a Random Graph is Even‐Decomposable von Oliver Janzer, Fredy Yip

    Veröffentlicht 2025
    Inhaltsangabe: “… & Algorithms ABSTRACT A graph with an even number of edges is called even‐decomposable if there is a sequence …”
    Volltext
    Artículo Open Access
  11. 111

    Beyond a Single Queue: Multi-Level-Multi-Queue as an Effective Design for SSSP problems on GPUs von Hu, Zhengding, Sun, Jingwen, Jiang, Le, Wang, Yuhao, Lin, Junqing, Zong, Yi, Sun, Guangzhong

    Veröffentlicht 2026
    Inhaltsangabe: “… -of-the-art implementations. Our code is open-sourced at https://github.com/Leo9660/MLMQ.git.  …”
    Volltext
    Preprint
  12. 112

    On the rank, Kernel, and core of sparse random graphs von Patrick DeMichele, Margalit Glasgow, Alexander Moreira

    Veröffentlicht 2024
    Inhaltsangabe: “… Moreira Random Structures & Algorithms AbstractWe study the rank of the adjacency matrix of a random Erdős …”
    Volltext
    Artículo Open Access
  13. 113

    A survey of BWT variants for string collections von Cenzato, Davide, Lipták, Zsuzsanna

    Veröffentlicht 2022
    Inhaltsangabe: “… multiplicative factor of up to $4.2$. Source code and scripts to replicate the results and download the data used …”
    Volltext
    Preprint
  14. 114

    Simpler and Improved Replacement Path Coverings von Bilò, Davide, Chechik, Shiri, Choudhary, Keerti, Cohen, Sarel, Schirneck, Martin

    Veröffentlicht 2026
    Inhaltsangabe: “… -correcting codes and an increased covering value of $O((cfL \log n)^{f+1})$ for some constant $c > 1$. We …”
    Volltext
    Preprint
  15. 115

    Width Parameters for Minimum Flow Decomposition von Grigorjew, Andreas, Jiamjitrak, Wanchote, Mumey, Brendan, Tomescu, Alexandru I.

    Veröffentlicht 2024
    Inhaltsangabe: “… general statement that MFD with unary coded input can be solved in quasi-polynomial time on DAGs …”
    Volltext
    Preprint
  16. 116

    Subset-lex: did we miss an order? von Arndt, Jörg

    Veröffentlicht 2014
    Inhaltsangabe: “… We generalize a well-known algorithm for the generation of all subsets of a set in lexicographic …”
    Volltext
    Preprint
  17. 117

    In-depth Analysis of Densest Subgraph Discovery in a Unified Framework von Zhou, Yingli, Guo, Qingshuo, Yang, Yi, Fang, Yixiang, Ma, Chenhao, Lakshmanan, Laks

    Veröffentlicht 2024
    Inhaltsangabe: “… of real applications. Several DSD algorithms, including exact and approximation algorithms, have been …”
    Volltext
    Preprint
  18. 118

    Fast computation of permanents over $\mathbb{F}_3$ via $\mathbb{F}_2$ arithmetic von Scheinerman, Danny

    Veröffentlicht 2024
    Inhaltsangabe: “… operations (and, or, xor). We use this machinery to develop a fast algorithm for computing the permanent of a …”
    Volltext
    Preprint
  19. 119

    Hecate: A Modular Genomic Compressor von Szewczyk, Kamila, Rahmann, Sven

    Veröffentlicht 2026
    Inhaltsangabe: “… but practical source-coding choices. Unlike many single-method compressors, Hecate treats compression as a …”
    Volltext
    Preprint
  20. 120

    Parameterized Algorithms for Diversity of Networks with Ecological Dependencies von Jones, Mark, Schestag, Jannik

    Veröffentlicht 2025
    Inhaltsangabe: “… , as it indicates where limited resources can be invested most efficiently. In recent years, efficient algorithms …”
    Volltext
    Preprint