In-place algorithm

Results: 34



#Item
1In-place Graph Rewriting with Interaction Nets Ian Mackie Shinya Sato  An algorithm is in-place, or runs in-situ, when it does not need any additional memory to execute

In-place Graph Rewriting with Interaction Nets Ian Mackie Shinya Sato An algorithm is in-place, or runs in-situ, when it does not need any additional memory to execute

Add to Reading List

Source URL: www.ianmackie.com

Language: English - Date: 2018-02-23 17:17:29
    2Charles University in Prague Faculty of Mathematics and Physics MASTER THESIS  Michal Vaner

    Charles University in Prague Faculty of Mathematics and Physics MASTER THESIS Michal Vaner

    Add to Reading List

    Source URL: vorner.cz

    Language: English - Date: 2012-04-16 02:58:44
    3Adaptive Matrix Transpose Algorithms for Distributed Multicore Processors John C. Bowman and Malcolm Roberts Abstract An adaptive parallel matrix transpose algorithm optimized for distributed multicore architectures runn

    Adaptive Matrix Transpose Algorithms for Distributed Multicore Processors John C. Bowman and Malcolm Roberts Abstract An adaptive parallel matrix transpose algorithm optimized for distributed multicore architectures runn

    Add to Reading List

    Source URL: www.math.ualberta.ca

    Language: English - Date: 2015-09-12 12:29:21
    4Scalable Distributed-Memory External Sorting Mirko Rahn, Peter Sanders, Johannes Singler4 Karlsruhe Institute of Technology Postfach 6980, 76128 Karlsruhe, Germany  arXiv:0910.2582v1 [cs.DS] 14 Oct 2009

    Scalable Distributed-Memory External Sorting Mirko Rahn, Peter Sanders, Johannes Singler4 Karlsruhe Institute of Technology Postfach 6980, 76128 Karlsruhe, Germany arXiv:0910.2582v1 [cs.DS] 14 Oct 2009

    Add to Reading List

    Source URL: arxiv.org

    Language: English - Date: 2009-10-14 08:51:26
    5AT&T Bell Laboratories Numerical Analysis ManuscriptCorrectly Rounded Binary-Decimal and Decimal-Binary Conversions

    AT&T Bell Laboratories Numerical Analysis ManuscriptCorrectly Rounded Binary-Decimal and Decimal-Binary Conversions

    Add to Reading List

    Source URL: ampl.com

    Language: English - Date: 2014-03-26 17:34:56
    6Floating-point arithmetic in the Coq system a,1 Guillaume Melquiond  a INRIA Saclay  Île-de-France,

    Floating-point arithmetic in the Coq system a,1 Guillaume Melquiond a INRIA Saclay  Île-de-France,

    Add to Reading List

    Source URL: www.lri.fr

    Language: English - Date: 2012-06-28 09:41:10
    7Engineering Burstsort: Toward Fast In-Place String Sorting RANJAN SINHA and ANTHONY WIRTH The University of Melbourne  Burstsort is a trie-based string sorting algorithm that distributes strings into small buckets whose

    Engineering Burstsort: Toward Fast In-Place String Sorting RANJAN SINHA and ANTHONY WIRTH The University of Melbourne Burstsort is a trie-based string sorting algorithm that distributes strings into small buckets whose

    Add to Reading List

    Source URL: www.cs.amherst.edu

    Language: English - Date: 2010-04-06 17:17:46
      8Fail-in-Place Network Design: Interaction between Topology, Routing Algorithm and Failures Jens Domke Torsten Hoefler

      Fail-in-Place Network Design: Interaction between Topology, Routing Algorithm and Failures Jens Domke Torsten Hoefler

      Add to Reading List

      Source URL: htor.inf.ethz.ch

      Language: English - Date: 2014-08-14 09:16:58
      9Fast Randomized Test-and-Set and Renaming Dan Alistarh1 , Hagit Attiya1,2 , Seth Gilbert1 , Andrei Giurgiu1 , and Rachid Guerraoui1 1 Ecole Polytechnique F´ed´erale de Lausanne, Lausanne, Switzerland 2

      Fast Randomized Test-and-Set and Renaming Dan Alistarh1 , Hagit Attiya1,2 , Seth Gilbert1 , Andrei Giurgiu1 , and Rachid Guerraoui1 1 Ecole Polytechnique F´ed´erale de Lausanne, Lausanne, Switzerland 2

      Add to Reading List

      Source URL: www.comp.nus.edu.sg

      Language: English - Date: 2011-11-17 23:45:01
      10Detecting and Exploiting Near-Sortedness for Efficient Relational Query Evaluation Sagi Ben-Moshe Eldar Fischer

      Detecting and Exploiting Near-Sortedness for Efficient Relational Query Evaluation Sagi Ben-Moshe Eldar Fischer

      Add to Reading List

      Source URL: www.cs.technion.ac.il

      Language: English - Date: 2011-01-20 12:03:47