Pair programming

Results: 71



#Item
1

On Knowledge Transfer Skill in Pair Programming Franz Zieris Lutz Prechelt Freie Universität Berlin

Add to Reading List

Source URL: www.inf.fu-berlin.de

Language: English - Date: 2017-02-28 09:36:20
    2

    Liberating Pair Programming Research from the Oppressive Driver/Observer Regime Stephan Salinger, Franz Zieris, Lutz Prechelt Freie Universit¨at Berlin Institut f¨ur Informatik Takustr. 9, 14195 Berlin, Germany

    Add to Reading List

    Source URL: www.inf.fu-berlin.de

    Language: English - Date: 2017-02-28 09:36:21
      3Dynamic programming / Maximal pair / String / String searching algorithm / Approximate string matching / Suffix tree / Mathematics / Computing / Computer programming / LCP array

      A PATTERN EXTRACTION ALGORITHM FOR ABSTRACT MELODIC REPRESENTATIONS THAT ALLOW PARTIAL OVERLAPPING OF INTERVALLIC CATEGORIES Emilios Cambouropoulos1 , Maxime Crochemore2,3 , Costas Iliopoulos3 , Manal Mohamed3 , Marie-Fr

      Add to Reading List

      Source URL: pbil.univ-lyon1.fr

      Language: English - Date: 2008-10-22 02:35:21
      4Graph theory / Computational complexity theory / Mathematics / NP-complete problems / Vertex cover / Steiner tree problem / Shortest path problem / Linear programming / Edge disjoint shortest pair algorithm / Minimum bottleneck spanning tree

      A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar

      Add to Reading List

      Source URL: www.cs.cmu.edu

      Language: English - Date: 2009-03-26 07:24:20
      5Theory of computation / Dynamic programming / Maximal pair / String / Mathematics / String searching algorithm / Suffix tree / Approximate string matching / Time complexity / Algorithm / Computer science

      doi:j.ins

      Add to Reading List

      Source URL: pbil.univ-lyon1.fr

      Language: English - Date: 2008-10-22 02:35:21
      6Routing algorithms / Network theory / Graph theory / Graph connectivity / Dynamic programming / FloydWarshall algorithm / Shortest path problem / Distance / Path / Planar separator theorem / Edge disjoint shortest pair algorithm

      COMPUTING SHORTEST PATHS USING SPARSE GAUSSIAN ELIMINATION Aydın Bulu¸c, John Gilbert, Sivan Toledo SIAM Workshop on Network Science 2014 July 6-7 · Chicago For example, U ∗ encodes the paths from lower numbered

      Add to Reading List

      Source URL: siam.org

      Language: English - Date: 2014-06-30 13:57:26
      7Compiler construction / Procedural programming languages / Parsing / Control characters / Compiling tools / Delete character / Recursive descent parser / LR parser / Parser combinator / Lexical analysis / Forth / Scheme

      Modular Rollback through Control Logging A Pair of Twin Functional Pearls Olin Shivers Aaron Turon

      Add to Reading List

      Source URL: www.mpi-sws.org

      Language: English - Date: 2011-07-18 13:38:38
      8

      Pair programming with Eclipse Che, Eclipse IDE, Eclipse Orion, Eclipse Flux and Docker Sun Seng David TAN @sunsengdavidtan

      Add to Reading List

      Source URL: snowcamp.io

      Language: English - Date: 2016-02-04 09:40:03
        9

        The Costs and Benefits of Pair Programming Alistair Cockburn Humans and Technology 7691 Dell Rd Salt Lake City, UT 84121, USA

        Add to Reading List

        Source URL: www.cs.pomona.edu

        Language: English - Date: 2007-08-16 17:48:56
          10

          Pair Programming: What’s in it for Me? Andrew Begel Nachiappan Nagappan Microsoft Research

          Add to Reading List

          Source URL: research.microsoft.com

          Language: English - Date: 2008-12-09 18:44:25
            UPDATE