dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Radoslaw Hofman Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2011
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRadoslaw Hofman, Andrzej Bassara: Web Services Trustworthiness Model - (Invited Paper). ServiceWave 2011: 268-277
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRadoslaw Hofman: Behavioral economics in software quality engineering. Empirical Software Engineering 16(2): 278-293 (2011)
2009
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRadoslaw Hofman: An Approach to Measuring Software Quality Perception. SCSS 2009: 307-312
2008
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRadoslaw Hofman: Software Quality Perception. SCSS (2) 2008: 31-37
2007
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRadoslaw Hofman: Complexity Considerations, cSAT Problem Lower Bound. IMECS 2007: 451-458
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRadoslaw Hofman: Why LP Cannot Solve Large Instances of NP-complete Problems in Polynomial Time. IMECS 2007: 596-599
2006
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRadoslaw Hofman: Report on article: P=NP Linear programming formulation of the Traveling Salesman Problem CoRR abs/cs/0610125: (2006)
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRadoslaw Hofman: Why Linear Programming cannot solve large instances of NP-complete problems in polynomial time CoRR abs/cs/0611008: (2006)

Coauthor Index

1Andrzej Bassara [8]

Last update Thu May 31 18:55:10 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page