|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 17 occurrences of 15 keywords
|
|
|
Results
Found 3 publication records. Showing 3 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Irina Diana Coman, Alberto Sillitti, Giancarlo Succi |
Investigating the Usefulness of Pair-Programming in a Mature Agile Team. ![Search on Bibsonomy](Pics/bibsonomy.png) |
XP ![In: Agile Processes in Software Engineering and Extreme Programming, 9th International Conference, XP 2008, Limerick, Ireland, June 10-14, 2008. Proceedings, pp. 127-136, 2008, Springer, 978-3-540-68254-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
XP, Agile Methods, Pair-programming, PP |
1 | Richard Beigel, Bin Fu |
Circuits Over PP and PL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, June 24-27, 1997, pp. 24-35, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
reduction, oracle, circuit, closure, PL, Boolean formula, AC, NC, PP |
1 | Seinosuke Toda |
On the Computational Power of PP and +P ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 514-519, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
two-sided bounded error probability, probabilistic Turing machine, (+)P, randomized polynomial-time reducibility, complexity classes, polynomial-time hierarchy, PH, PP |
Displaying result #1 - #3 of 3 (100 per page; Change: )
|
|