The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andreas Weber: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andreas Weber
    On the Lengths of Values in a Finite Transducer. [Citation Graph (1, 0)][DBLP]
    Acta Inf., 1992, v:29, n:6/7, pp:663-687 [Journal]
  2. Stephan A. Missura, Andreas Weber
    Using Commutativity Properties for Controlling Coercions. [Citation Graph (0, 0)][DBLP]
    AISMC, 1994, pp:131-143 [Conf]
  3. Andreas Weber
    A Type-Coercion Problem in Computer Algebra. [Citation Graph (0, 0)][DBLP]
    AISMC, 1992, pp:188-194 [Conf]
  4. Mario Daberkow, Andreas Weber
    A Database for Number Fields. [Citation Graph (0, 0)][DBLP]
    DISCO, 1996, pp:320-330 [Conf]
  5. Andreas Weber
    On Coherence in Computer Algebra. [Citation Graph (0, 0)][DBLP]
    DISCO, 1993, pp:95-106 [Conf]
  6. Andreas Weber
    Transforming a Single-Valued Transducer Into a Mealy Machine. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1995, pp:176-185 [Conf]
  7. 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 [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:118-125 [Conf]
  8. Wolfgang Blochinger, Wolfgang Küchlin, Andreas Weber
    The Distributed Object-Oriented Threads System DOTS. [Citation Graph (0, 0)][DBLP]
    IRREGULAR, 1998, pp:206-217 [Conf]
  9. Andreas Weber
    Algorithms for Type Inference with Coercions. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1994, pp:324-329 [Conf]
  10. Andreas Weber
    Decomposing a k-valued Transducer into k Unambiguous Ones. [Citation Graph (0, 0)][DBLP]
    LATIN, 1992, pp:503-515 [Conf]
  11. Andreas Weber
    Distance Automata Having Large Finite Distance or Finite Ambiguity. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:508-515 [Conf]
  12. Andreas Weber
    On the Length of Values in a Finite Transducer. [Citation Graph (0, 0)][DBLP]
    MFCS, 1989, pp:523-533 [Conf]
  13. Andreas Weber, Tom Head
    The Finest Homophonic Partition and Related Code Concepts. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:618-628 [Conf]
  14. Andreas Weber, Helmut Seidl
    On the Degree of Ambiguity of Finite Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:620-629 [Conf]
  15. Andreas Weber
    A Decomposition Theorem for Finite-Valued Tranducers and an Application to the Equivalence Problem. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:552-562 [Conf]
  16. Andreas Weber, Reinhard Klemm
    Economy of Description for Single-valued Transducers. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:607-618 [Conf]
  17. Andreas Weber
    On the Valuedness of Finite Transducers. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1989, v:27, n:8, pp:749-780 [Journal]
  18. Arnulph Fuhrmann, Clemens Groß, Volker Luckas, Andreas Weber
    Interaction-free dressing of virtual humans. [Citation Graph (0, 0)][DBLP]
    Computers & Graphics, 2003, v:27, n:1, pp:71-82 [Journal]
  19. Andreas Weber, Wolfgang Küchlin, Bernhard Eggers
    Parallel Computer Algebra Software as a Web Component. [Citation Graph (0, 0)][DBLP]
    Concurrency - Practice and Experience, 1998, v:10, n:11-13, pp:1179-1188 [Journal]
  20. Andreas Weber, Reinhard Klemm
    Economy of Description for Single-Valued Transducers [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:118, n:2, pp:327-340 [Journal]
  21. Andreas Weber
    Decomposing A k-Valued Transducer into k Unambiguous Ones. [Citation Graph (0, 0)][DBLP]
    ITA, 1996, v:30, n:5, pp:379-413 [Journal]
  22. Andreas Weber, Helmut Seidl
    On finitely generated monoids of matrices with entries in N. [Citation Graph (0, 0)][DBLP]
    ITA, 1991, v:25, n:, pp:19-38 [Journal]
  23. 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. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1987, v:34, n:3, pp:513-531 [Journal]
  24. Andreas Weber
    Transforming a Single-Valued Transducer Into a Mealy Machine. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1998, v:56, n:1, pp:46-59 [Journal]
  25. Andreas Weber
    Distance Automata Having Large Finite Distance or Finite Ambiguity. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1993, v:26, n:2, pp:169-185 [Journal]
  26. Andreas Weber
    Decomposing Finite-Valued Transducers and Deciding Their Equivalence. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:175-202 [Journal]
  27. Andreas Weber
    Finite-Valued Distance Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:134, n:1, pp:225-251 [Journal]
  28. Andreas Weber
    Exponential Upper and Lower Bounds for the Order of a Regular Language. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:134, n:1, pp:253-262 [Journal]
  29. Andreas Weber, Helmut Seidl
    On the Degree of Ambiguity of Finite Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:88, n:2, pp:325-349 [Journal]
  30. Tom Head, Andreas Weber
    Deciding multiset decipherability. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:1, pp:291-297 [Journal]
  31. Andreas Weber, Tom Head
    The finest homophonic partition and related code concepts. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1569-1575 [Journal]
  32. Björn Krüger, Jochen Tautges, Andreas Weber
    Multi-mode representation of motion data. [Citation Graph (0, 0)][DBLP]
    GRAPP (AS/IE), 2007, pp:21-29 [Conf]

  33. Generating optimised satellite payload operation schedules with Evolutionary Algorithms. [Citation Graph (, )][DBLP]


  34. Protocol Interference Between UP-and Downlink Channels in HSDPA. [Citation Graph (, )][DBLP]


  35. LTE and HSPA+: Revolutionary and evolutionary solutions for global mobile broadband. [Citation Graph (, )][DBLP]


  36. Performance assessment of next-generation wireless mobile systems. [Citation Graph (, )][DBLP]


Search in 0.185secs, Finished in 0.186secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002