<--- Back to Details
First PageDocument Content
Computer programming / Extreme programming / Pair programming / Software review / Software development process / Programming language / Programming productivity / Programmer / Software development methodology / Software development / Computing / Software engineering
Date: 2007-01-14 16:42:14
Computer programming
Extreme programming
Pair programming
Software review
Software development process
Programming language
Programming productivity
Programmer
Software development methodology
Software development
Computing
Software engineering

doi:[removed]j.ijhcs[removed]

Add to Reading List

Source URL: www.cs.utexas.edu

Download Document from Source Website

File Size: 300,25 KB

Share Document on Facebook

Similar Documents

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

DocID: 1uJdM - View Document

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

DocID: 1uBcX - View Document

Dynamic 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

DocID: 1rgdB - View Document

Graph 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

DocID: 1r7hn - View Document

Theory of computation / Dynamic programming / Maximal pair / String / Mathematics / String searching algorithm / Suffix tree / Approximate string matching / Time complexity / Algorithm / Computer science

doi:j.ins

DocID: 1r4I2 - View Document