Mob programming: the state of the art and three case studies of open source software (2018)
- Authors:
- Autor USP: LEJBMAN, ALFREDO GOLDMAN VEL - IME
- Unidade: IME
- DOI: 10.1007/978-3-319-73673-0_12
- Assunto: DESENVOLVIMENTO DE SOFTWARE
- Keywords: collaboration in software development; agile practice; programming teams; programming technique; software development approach; mob programming
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Proceedings
- Conference titles: Brazilian Workshop - WBMA
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
KATTAN, Herez Moise et al. Mob programming: the state of the art and three case studies of open source software. 2018, Anais.. Cham: Springer, 2018. Disponível em: https://doi.org/10.1007/978-3-319-73673-0_12. Acesso em: 14 jan. 2026. -
APA
Kattan, H. M., Oliveira, F., Goldman, A., & Yoder, J. W. (2018). Mob programming: the state of the art and three case studies of open source software. In Proceedings. Cham: Springer. doi:10.1007/978-3-319-73673-0_12 -
NLM
Kattan HM, Oliveira F, Goldman A, Yoder JW. Mob programming: the state of the art and three case studies of open source software [Internet]. Proceedings. 2018 ;[citado 2026 jan. 14 ] Available from: https://doi.org/10.1007/978-3-319-73673-0_12 -
Vancouver
Kattan HM, Oliveira F, Goldman A, Yoder JW. Mob programming: the state of the art and three case studies of open source software [Internet]. Proceedings. 2018 ;[citado 2026 jan. 14 ] Available from: https://doi.org/10.1007/978-3-319-73673-0_12 - A multithreaded resolution of the service selection problem based on domain decomposition and work stealing
- Thematic series on service composition for the future internet
- Jornadas mais rápidas e compromissos em DTNs
- Improving mobile app development using transpilers with maintainable outputs
- A CPU-FPGA heterogeneous approach for biological sequence comparison using high-level synthesis
- Exchanging messages of different sizes
- Combining parallel algorithms solving the same application: what is the best approach?
- Actor scheduling for multicore hierarchical memory platforms
- Scheduling with duplication on m processors with small communication delays
- Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs
Informações sobre o DOI: 10.1007/978-3-319-73673-0_12 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
2874196.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
