other persons with the same name:
- CSB - MetaPress - Google - Bing - Yahoo
 | 2009 | |
|---|---|---|
| 35 |      | Krishna Balachandran, Qi Bi, Ashok N. Rudrapatna, James P. Seymour, Robert Soni, Andreas Weber: Performance assessment of next-generation wireless mobile systems. Bell Labs Technical Journal 13(4): 35-58 (2009) |
| 34 | | Anil M. Rao, Andreas Weber, Sridhar Gollamudi, Robert Soni: LTE and HSPA+: Revolutionary and evolutionary solutions for global mobile broadband. Bell Labs Technical Journal 13(4): 7-34 (2009) |
| 2008 | ||
| 33 | | Thomas Sturm, Andreas Weber: Investigating Generic Methods to Solve Hopf Bifurcation Problems in Algebraic Biology. AB 2008: 200-215 |
| 2007 | ||
| 32 |  | Björn Krüger, Jochen Tautges, Andreas Weber: Multi-mode representation of motion data. GRAPP (AS/IE) 2007: 21-29 |
| 2003 | ||
| 31 | | Arnulph Fuhrmann, Clemens Groß, Volker Luckas, Andreas Weber: Interaction-free dressing of virtual humans. Computers & Graphics 27(1): 71-82 (2003) |
| 1998 | ||
| 30 | | Wolfgang Blochinger, Wolfgang Küchlin, Andreas Weber: The Distributed Object-Oriented Threads System DOTS. IRREGULAR 1998: 206-217 |
| 29 | | Andreas Weber, Wolfgang Küchlin, Bernhard Eggers: Parallel Computer Algebra Software as a Web Component. Concurrency - Practice and Experience 10(11-13): 1179-1188 (1998) |
| 28 | | Andreas Weber: Transforming a Single-Valued Transducer Into a Mealy Machine. J. Comput. Syst. Sci. 56(1): 46-59 (1998) |
| 1996 | ||
| 27 | | Mario Daberkow, Andreas Weber: A Database for Number Fields. DISCO 1996: 320-330 |
| 26 | | Andreas Weber, Tom Head: The finest homophonic partition and related code concepts. IEEE Transactions on Information Theory 42(5): 1569-1575 (1996) |
| 25 | | Andreas Weber: Decomposing A k-Valued Transducer into k Unambiguous Ones. ITA 30(5): 379-413 (1996) |
| 1995 | ||
| 24 | | Andreas Weber: Transforming a Single-Valued Transducer Into a Mealy Machine. Developments in Language Theory 1995: 176-185 |
| 23 | | Tom Head, Andreas Weber: Deciding multiset decipherability. IEEE Transactions on Information Theory 41(1): 291-297 (1995) |
| 22 | | Andreas Weber, Reinhard Klemm: Economy of Description for Single-Valued Transducers Inf. Comput. 118(2): 327-340 (1995) |
| 1994 | ||
| 21 | | Stephan A. Missura, Andreas Weber: Using Commutativity Properties for Controlling Coercions. AISMC 1994: 131-143 |
| 20 | | Andreas Weber: Algorithms for Type Inference with Coercions. ISSAC 1994: 324-329 |
| 19 | | Andreas Weber, Tom Head: The Finest Homophonic Partition and Related Code Concepts. MFCS 1994: 618-628 |
| 18 | | Andreas Weber, Reinhard Klemm: Economy of Description for Single-valued Transducers. STACS 1994: 607-618 |
| 17 | | Andreas Weber: Finite-Valued Distance Automata. Theor. Comput. Sci. 134(1): 225-251 (1994) |
| 16 | | Andreas Weber: Exponential Upper and Lower Bounds for the Order of a Regular Language. Theor. Comput. Sci. 134(1): 253-262 (1994) |
| 1993 | ||
| 15 | | Andreas Weber: On Coherence in Computer Algebra. DISCO 1993: 95-106 |
| 14 | | Andreas Weber: Distance Automata Having Large Finite Distance or Finite Ambiguity. Mathematical Systems Theory 26(2): 169-185 (1993) |
| 13 | | Andreas Weber: Decomposing Finite-Valued Transducers and Deciding Their Equivalence. SIAM J. Comput. 22(1): 175-202 (1993) |
| 1992 | ||
| 12 | | Andreas Weber: A Type-Coercion Problem in Computer Algebra. AISMC 1992: 188-194 |
| 11 | | Andreas Weber: Decomposing a k-valued Transducer into k Unambiguous Ones. LATIN 1992: 503-515 |
| 10 | | Andreas Weber: On the Lengths of Values in a Finite Transducer. Acta Inf. 29(6/7): 663-687 (1992) |
| 1991 | ||
| 9 | | Andreas Weber, Helmut Seidl: On finitely generated monoids of matrices with entries in N. ITA 25: 19-38 (1991) |
| 8 | | Andreas Weber, Helmut Seidl: On the Degree of Ambiguity of Finite Automata. Theor. Comput. Sci. 88(2): 325-349 (1991) |
| 1990 | ||
| 7 | | Andreas Weber: Distance Automata Having Large Finite Distance or Finite Ambiguity. MFCS 1990: 508-515 |
| 1989 | ||
| 6 | | Andreas Weber: On the Length of Values in a Finite Transducer. MFCS 1989: 523-533 |
| 5 | | Andreas Weber: On the Valuedness of Finite Transducers. Acta Inf. 27(8): 749-780 (1989) |
| 1988 | ||
| 4 | | Andreas Weber: A Decomposition Theorem for Finite-Valued Tranducers and an Application to the Equivalence Problem. MFCS 1988: 552-562 |
| 1987 | ||
| 3 | | Zvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber: An O(n³log n) deterministic and an O(n³) Las Vegs isomorphism test for trivalent graphs. J. ACM 34(3): 513-531 (1987) |
| 1986 | ||
| 2 | | Andreas Weber, Helmut Seidl: On the Degree of Ambiguity of Finite Automata. MFCS 1986: 620-629 |
| 1982 | ||
| 1 | | Zvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber: An O(n^3 log n) Deterministic and an O(n^3) Probabilistic Isomorphism Test for Trivalent Graphs FOCS 1982: 118-125 |
| 1 | Krishna Balachandran | [35] |
| 2 | Qi Bi | [35] |
| 3 | Wolfgang Blochinger | [30] |
| 4 | Mario Daberkow | [27] |
| 5 | Bernhard Eggers | [29] |
| 6 | Arnulph Fuhrmann | [31] |
| 7 | Zvi Galil | [1] [3] |
| 8 | Sridhar Gollamudi | [34] |
| 9 | Clemens Groß | [31] |
| 10 | Tom Head | [19] [23] [26] |
| 11 | Christoph M. Hoffmann | [1] [3] |
| 12 | Reinhard Klemm | [18] [22] |
| 13 | Björn Krüger | [32] |
| 14 | Wolfgang Küchlin | [29] [30] |
| 15 | Volker Luckas | [31] |
| 16 | Eugene M. Luks | [1] [3] |
| 17 | Stephan A. Missura | [21] |
| 18 | Anil M. Rao | [34] |
| 19 | Ashok N. Rudrapatna | [35] |
| 20 | Claus-Peter Schnorr | [1] [3] |
| 21 | Helmut Seidl | [2] [8] [9] |
| 22 | James P. Seymour | [35] |
| 23 | Robert Soni | [34] [35] |
| 24 | Thomas Sturm | [33] |
| 25 | Jochen Tautges | [32] |