# Andreas Weber

According to our database

Collaborative distances :

^{1}, Andreas Weber authored at least 33 papers between 1986 and 2013.Collaborative distances :

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2013

Heterogeneous Networks With LTE-Advanced Technologies.

Bell Labs Technical Journal, 2013

2012

Scheduling strategies for HetNets using eICIC.

Proceedings of IEEE International Conference on Communications, 2012

2011

Modeling of X-pol antennas for LTE system simulation.

Proceedings of the 8th International Symposium on Wireless Communication Systems, 2011

2009

Generating optimised satellite payload operation schedules with Evolutionary Algorithms.

Proceedings of the IEEE Congress on Evolutionary Computation, 2009

2006

Protocol Interference Between UP-and Downlink Channels in HSDPA.

Proceedings of the IEEE 17th International Symposium on Personal, 2006

2005

Impact of Iub flow control on HSDPA system performance.

Proceedings of the IEEE 16th International Symposium on Personal, 2005

2002

The 'Surplus of Meaning'. Biosemiotic aspects in Francisco J. Varela's philosophy of cognition.

Cybernetics and Human Knowing, 2002

1998

Transforming a Single-Valued Transducer Into a Mealy Machine.

J. Comput. Syst. Sci., 1998

1996

The finest homophonic partition and related code concepts.

IEEE Trans. Information Theory, 1996

Decomposing A

*k*-Valued Transducer into*k*Unambiguous Ones.
ITA, 1996

Computing radical expressions for roots of unity.

ACM SIGSAM Bulletin, 1996

1995

Economy of Description for Single-Valued Transducers

Inf. Comput., May, 1995

Deciding multiset decipherability.

IEEE Trans. Information Theory, 1995

Transforming a Single-Valued Transducer Into a Mealy Machine.

Proceedings of the Developments in Language Theory II, 1995

1994

Exponential Upper and Lower Bounds for the Order of a Regular Language.

Theor. Comput. Sci., 1994

Finite-Valued Distance Automata.

Theor. Comput. Sci., 1994

Economy of Description for Single-valued Transducers.

Proceedings of the STACS 94, 1994

The Finest Homophonic Partition and Related Code Concepts.

Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Algorithms for Type Inference with Coercions.

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1994

1993

Decomposing Finite-Valued Transducers and Deciding Their Equivalence.

SIAM J. Comput., 1993

Distance Automata Having Large Finite Distance or Finite Ambiguity.

Mathematical Systems Theory, 1993

On Coherence in Computer Algebra.

Proceedings of the Design and Implementation of Symbolic Computation Systems, 1993

1992

Ein relationsbasiertes Datenmodell als Grundlage für die Bauteil-Tolerierung.

PhD thesis, 1992

On the Lengths of Values in a Finite Transducer.

Acta Inf., 1992

Proceedings of the LATIN '92, 1992

1991

On the Degree of Ambiguity of Finite Automata.

Theor. Comput. Sci., 1991

On finitely generated monoids of matrices with entries in N.

ITA, 1991

1990

On the Valuedness of Finite Transducers.

Acta Inf., 1990

Distance Automata Having Large Finite Distance or Finite Ambiguity.

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

1989

On the Length of Values in a Finite Transducer.

Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

1988

A Decomposition Theorem for Finite-Valued Tranducers and an Application to the Equivalence Problem.

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1987

Eine Methode zur Aktualisierung Aussagenlogischer Wissensbasen.

PhD thesis, 1987

1986

On the Degree of Ambiguity of Finite Automata.

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986