Travelled to:1 × Estonia
1 × Finland
1 × Greece
1 × Italy
1 × USA
Collaborated with:C.Bäckström G.Nordh M.Bodirsky T.v.Oertzen T.Drakengren S.Eldh S.Punnekkat H.Hansson
Talks about:abstract (2) algebra (2) circumscript (1) semilinear (1) middlewar (1) tractabl (1) subclass (1) proposit (1) approach (1) telecom (1)
Person: Peter Jönsson
DBLP: J=ouml=nsson:Peter
Contributed to:
2012
2009
2007
20041996Wrote 5 papers:
- KR-2012-BackstromJ #abstraction
- Abstracting Abstraction in Search with Applications to Planning (CB, PJ).
- ICALP-v2-2009-BodirskyJO #linear
- Semilinear Program Feasibility (MB, PJ, TvO), pp. 79–90.
- TestCom-FATES-2007-EldhPHJ #case study #component #fault #middleware #testing
- Component Testing Is Not Enough — A Study of Software Faults in Telecom Middleware (SE, SP, HH, PJ), pp. 74–89.
- LICS-2004-NordhJ #algebra #approach #complexity
- An Algebraic Approach to the Complexity of Propositional Circumscription (GN, PJ), pp. 367–376.
- KR-1996-JonssonDB #algebra #classification #subclass
- Tractable Subclasses of the Point-Interval Algebra: A Complete Classification (PJ, TD, CB), pp. 352–363.