Andreas Weber - researchr alias

researchr

You are not signed in
Sign in
Sign up

2010

2009

2008

Investigating Generic Methods to Solve Hopf Bifurcation Problems in Algebraic BiologyThomas Sturm, Andreas Weber. ab 2008: 200-215 [doi]

2007

Multi-mode representation of motion dataBjörn Krüger, Jochen Tautges, Andreas Weber. grapp 2007: 21-29

2006

Protocol Interference Between UP-and Downlink Channels in HSDPAMarc C. Necker, Andreas Weber. pimrc 2006: 1-5 [doi]

2005

Algorithmic Methods for Investigating Equilibria in Epidemic ModelingChristopher W. Brown, M hammed El Kahoui, Dominik Novotni, Andreas Weber. BIRTHDAY 2005: 59-63

2003

Interaction-free dressing of virtual humansArnulph Fuhrmann, Clemens Groß, Volker Luckas, Andreas Weber. cg, 27(1):71-82, 2003. [doi]

Einführung in die Informatik - objektorientiert mit Java (2. Aufl.)Wolfgang Küchlin, Andreas Weber. Springer-Lehrbuch, Springer, 2003.

1998

The Distributed Object-Oriented Threads System DOTSWolfgang Blochinger, Wolfgang Küchlin, Andreas Weber. irregular 1998: 206-217

Transforming a Single-Valued Transducer Into a Mealy MachineAndreas Weber. jcss, 56(1):46-59, 1998.

Parallel Computer Algebra Software as a Web ComponentAndreas Weber, Wolfgang Küchlin, Bernhard Eggers. concurrency, 10(11-13):1179-1188, 1998.

1996

A Database for Number FieldsMario Daberkow, Andreas Weber. disco 1996: 320-330

Decomposing A ::::k::::-Valued Transducer into ::::k:::: Unambiguous OnesAndreas Weber. ita, 30(5):379-413, 1996.

The finest homophonic partition and related code conceptsAndreas Weber, Tom Head. TIT, 42(5):1569-1575, 1996.

1995

Deciding multiset decipherabilityTom Head, Andreas Weber. TIT, 41(1):291-297, 1995.

Transforming a Single-Valued Transducer Into a Mealy MachineAndreas Weber. dlt 1995: 176-185

Economy of Description for Single-Valued TransducersAndreas Weber, Reinhard Klemm. iandc, 118(2):327-340, May 1995.

1994

1993

Decomposing Finite-Valued Transducers and Deciding Their EquivalenceAndreas Weber. siamcomp, 22(1):175-202, 1993.

Distance Automata Having Large Finite Distance or Finite AmbiguityAndreas Weber. mst, 26(2):169-185, 1993.

On Coherence in Computer AlgebraAndreas Weber. disco 1993: 95-106

1992

On the Lengths of Values in a Finite TransducerAndreas Weber. ACTA, 29(6/7):663-687, 1992.

Decomposing a ::::k::::-valued Transducer into ::::k:::: Unambiguous OnesAndreas Weber. latin 1992: 503-515

A Type-Coercion Problem in Computer AlgebraAndreas Weber. AISC 1993: 188-194

1991

On the Degree of Ambiguity of Finite AutomataAndreas Weber, Helmut Seidl. TCS, 88(2):325-349, 1991.

On finitely generated monoids of matrices with entries in NAndreas Weber, Helmut Seidl. ita, 25:19-38, 1991.

1990

Distance Automata Having Large Finite Distance or Finite AmbiguityAndreas Weber. mfcs 1990: 508-515

1989

On the Valuedness of Finite TransducersAndreas Weber. ACTA, 27(8):749-780, 1989.

On the Length of Values in a Finite TransducerAndreas Weber. mfcs 1989: 523-533

1988

A Decomposition Theorem for Finite-Valued Tranducers and an Application to the Equivalence ProblemAndreas Weber. mfcs 1988: 552-562

1987

An O(n³log n) deterministic and an O(n³) Las Vegs isomorphism test for trivalent graphsZvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber. JACM, 34(3):513-531, 1987. [doi]

1986

On the Degree of Ambiguity of Finite AutomataAndreas Weber, Helmut Seidl. mfcs 1986: 620-629

1982

An O(n^3 log n) Deterministic and an O(n^3) Probabilistic Isomorphism Test for Trivalent GraphsZvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber. focs 1982: 118-125