Stefan Arnborg - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 32 from 32

2020

Seeing Arboretum for the (partial k-) TreesStefan Arnborg, Andrzej Proskurowski. BIRTHDAY 2020: 3-6 [doi]

2016

Robust Bayesian analysis in partially ordered plausibility calculiStefan Arnborg. ijar, 78:1-14, 2016. [doi]

2006

Robust Bayesianism: Relation to Evidence TheoryStefan Arnborg. jaif, 1(1):75-90, 2006. [doi]

An Information Fusion Game ComponentJoel Brynielsson, Stefan Arnborg. jaif, 1(2):108-121, 2006. [doi]

2005

A bayesian recurrent neural network for unsupervised pattern recognition in large incomplete data setsRoland Orre, Andrew Bate, G. Niklas Norén, Erik Swahn, Stefan Arnborg, I. Ralph Edwards. IJNS, 15(3):207-222, 2005. [doi]

2002

Data Mining in Schizophrenia Research - Preliminary AnalysisStefan Arnborg, Ingrid Agartz, Håkan Hall, Erik Jönsson, Anna Sillén, Göran Sedvall. pkdd 2002: 27-38 [doi]

2000

Bayes Rules in Finite ModelsStefan Arnborg, Gunnar Sjödin. ecai 2000: 571-575

1999

Learning in prevision SpaceStefan Arnborg. isipta 1999: 8-14 [doi]

1995

Decomposable Structures, Boolean Function Representations, and OptimizationStefan Arnborg. mfcs 1995: 21-36

1994

A Technique for Recognizing Graphs of Bounded Treewidth with Application to Subclasses of Partial 2-PathsStefan Arnborg, Andrzej Proskurowski. tagt 1996: 469-486

1993

Decomposability Helps for Deciding Logics of Knowledge and BeliefStefan Arnborg. Dagstuhl 1994: 37-50

Graph decompositions and tree automata in reasoning with uncertaintyStefan Arnborg. jetai, 5(4):335-357, 1993. [doi]

An Algebraic Theory of Graph ReductionStefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese. JACM, 40(5):1134-1164, 1993. [doi]

1992

Canonical Representations of Partial 2- and 3-TreesStefan Arnborg, Andrzej Proskurowski. bit, 32(2):197-214, 1992.

1991

Easy Problems for Tree-Decomposable GraphsStefan Arnborg, Jens Lagergren, Detlef Seese. jal, 12(2):308-340, 1991.

Finding Minimal Forbidden Minors Using a Finite CongruenceJens Lagergren, Stefan Arnborg. icalp 1991: 532-543

1990

1989

Linear time algorithms for NP-hard problems restricted to partial k-treesStefan Arnborg, Andrzej Proskurowski. DAM, 23(1):11-24, 1989. [doi]

1988

An Equivalence Decision Problem in Systolic Array VerificationParosh Aziz Abdulla, Stefan Arnborg. facs 1990: 236-245

Algebraic Decomposition of Regular CurvesStefan Arnborg, Huichun Feng. JSC, 5(1/2):131-140, 1988.

Experiments with a Projection Operator for Algebraic DecompositionStefan Arnborg. issac 1989: 177-182

Problems Easy for Tree-Decomposable Graphs (Extended Abstract)Stefan Arnborg, Jens Lagergren, Detlef Seese. icalp 1988: 38-51

1987

Unification Problems with One-Sided DistributivityErik Tidén, Stefan Arnborg. JSC, 3(1/2):183-202, 1987.

1986

Algebraic decomposition of regular curvesStefan Arnborg, Huichun Feng. issac 1986: 53-55 [doi]

1985

Problems on graphs with bounded decomposabilityStefan Arnborg, Andrzej Proskurowski. eatcs, 25:7-10, 1985.

Unification Problems with One-Sided DistributivityStefan Arnborg, Erik Tidén. RTA 1985: 398-406

Efficient Algorithms for Combinatorial Problems with Bounded Decomposability - A SurveyStefan Arnborg. bit, 25(1):2-23, 1985.

1980

A Simple Query Language Based on Set AlgebraStefan Arnborg. bit, 20(3):266-278, 1980.

1974

Abstract Computation Model Used for a Production CompilerStefan Arnborg. ipl, 3(2):46-50, 1974.

Sign in or sign up to see more results.

runs on WebDSL