default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Weber
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. The links to all actual bibliographies of persons of the same or a similar name can be found below. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Other persons with the same name
- Andreas Weber 0001 — Nokia Bell Labs, Stuttgart, Germany (and 2 more)
- Andreas Weber 0002 — Fachhochschule Flensburg, Germany
- Andreas Weber 0003 — Hamburg University of Technology, Germany
- Andreas Weber 0004
![[0000-0001-5624-3368]](https://dblp.org/img/orcid-mark.12x12.png "0000-0001-5624-3368")
(aka: Andreas G. Weber) — University of Bonn, Institute of Computer Science, Germany (and 3 more) - Andreas Weber 0005 — University of Bayreuth, Germany
- Andreas Weber 0006 — University of Frankfurt, Mathematics Department, Germany
- Andreas Weber 0007 — Karlsruhe Institute of Technology, AIFB, Germany
- Andreas Weber 0008 — University of Twente, Enschede, The Netherlands (and 1 more)
- Andreas Weber 0009 — University of Erlangen-Nuremberg, Germany
- Andreas Weber 0010 — Karlsruhe Institute of Technology, Germany
Other persons with a similar name
- Andreas B. Weber — Fraunhofer Institute for Open Communication Systems (FOKUS), Berlin, Germany
- Andreas P. M. Weber
- Philip Andreas Weber
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c18]Florian Frank, Martin Schmid, Felix Klement, Purushothaman Palani, Andreas Weber, Elif Bilge Kavun, Wenjie Xiong, Tolga Arul, Stefan Katzenbeisser:
Secure Data-Binding in FPGA-based Hardware Architectures utilizing PUFs. AsiaCCS 2024- 2023
- [c17]Thomas Monninger, Andreas Weber, Steffen Staab:
Semantic Map Learning of Traffic Light to Lane Assignment based on Motion Data. ITSC 2023: 1583-1590 - [i1]Thomas Monninger, Andreas Weber, Steffen Staab:
Semantic Map Learning of Traffic Light to Lane Assignment based on Motion Data. CoRR abs/2309.14793 (2023) - 2021
- [j18]Branka Stojanovic, Josip Bozic, Katharina Hofer-Schmitz, Kai Nahrgang, Andreas Weber, Atta Badii, Maheshkumar Sundaram, Elliot Jordan, Joel Runevic:
Follow the Trail: Machine Learning for Fraud Detection in Fintech Applications. Sensors 21(5): 1594 (2021) - [j17]Dominik Kahl, Andreas Weber, Maik Kschischo:
Localization of Invariable Sparse Errors in Dynamic Systems. IEEE Trans. Control. Netw. Syst. 8(4): 1649-1658 (2021) - 2020
- [j16]Andreas Weber:
Potenziale digitalisierter Fotobestände für die Erschließung, Nutzung und Vermittlung in Archiven. ZfBB 67(5-6): 362-370 (2020)
2010 – 2019
- 2019
- [c16]Tabea Tietz, Jörg Waitelonis, Kanran Zhou, Paul Felgentreff, Nils Meyer, Andreas Weber, Harald Sack:
Linked Stage Graph. SEMANTiCS (Posters & Demos) 2019
2000 – 2009
- 2009
- [c15]Andreas Weber, Stefanos Fasoulas, Klaus Wolf:
Generating optimised satellite payload operation schedules with Evolutionary Algorithms. IEEE Congress on Evolutionary Computation 2009: 2332-2339 - 2006
- [c14]Marc C. Necker, Andreas Weber:
Protocol Interference Between UP-and Downlink Channels in HSDPA. PIMRC 2006: 1-5 - 2005
- [c13]Marc C. Necker, Andreas Weber:
Parameter Selection for HSDPA Iub Flow Control. ISWCS 2005: 233-237 - [c12]Marc C. Necker, Andreas Weber:
Impact of Iub flow control on HSDPA system performance. PIMRC 2005: 1703-1707 - 2002
- [j15]Andreas Weber:
The 'Surplus of Meaning'. Biosemiotic aspects in Francisco J. Varela's philosophy of cognition. Cybern. Hum. Knowing 9(2): 11-29 (2002)
1990 – 1999
- 1999
- [c11]Christoph Richard, Andreas Weber:
A Symbolic Numeric Environment for Analyzing Measurement Data in Multi-Model Settings (Extended Abstract). CASC 1999: 343-347 - 1998
- [j14]Andreas Weber:
Transforming a Single-Valued Transducer Into a Mealy Machine. J. Comput. Syst. Sci. 56(1): 46-59 (1998) - 1996
- [j13]Andreas Weber:
Computing radical expressions for roots of unity. SIGSAM Bull. 30(3): 11-20 (1996) - [j12]Andreas Weber:
Decomposing A k-Valued Transducer into k Unambiguous Ones. RAIRO Theor. Informatics Appl. 30(5): 379-413 (1996) - [j11]Andreas Weber, Tom Head:
The finest homophonic partition and related code concepts. IEEE Trans. Inf. Theory 42(5): 1569-1575 (1996) - 1995
- [j10]Andreas Weber, Reinhard Klemm:
Economy of Description for Single-Valued Transducers. Inf. Comput. 118(2): 327-340 (1995) - [j9]Tom Head, Andreas Weber:
Deciding multiset decipherability. IEEE Trans. Inf. Theory 41(1): 291-297 (1995) - [c10]Andreas Weber:
Transforming a Single-Valued Transducer Into a Mealy Machine. Developments in Language Theory 1995: 176-185 - 1994
- [j8]Andreas Weber:
Finite-Valued Distance Automata. Theor. Comput. Sci. 134(1): 225-251 (1994) - [j7]Andreas Weber:
Exponential Upper and Lower Bounds for the Order of a Regular Language. Theor. Comput. Sci. 134(1): 253-262 (1994) - [c9]Andreas Weber:
Algorithms for Type Inference with Coercions. ISSAC 1994: 324-329 - [c8]Andreas Weber, Tom Head:
The Finest Homophonic Partition and Related Code Concepts. MFCS 1994: 618-628 - [c7]Andreas Weber, Reinhard Klemm:
Economy of Description for Single-valued Transducers. STACS 1994: 607-618 - 1993
- [j6]Andreas Weber:
Distance Automata Having Large Finite Distance or Finite Ambiguity. Math. Syst. Theory 26(2): 169-185 (1993) - [j5]Andreas Weber:
Decomposing Finite-Valued Transducers and Deciding Their Equivalence. SIAM J. Comput. 22(1): 175-202 (1993) - [c6]Andreas Weber:
On Coherence in Computer Algebra. DISCO 1993: 95-106 - 1992
- [j4]Andreas Weber:
On the Lengths of Values in a Finite Transducer. Acta Informatica 29(6/7): 663-687 (1992) - [c5]Andreas Weber:
Decomposing a k-valued Transducer into k Unambiguous Ones. LATIN 1992: 503-515 - 1991
- [j3]Andreas Weber, Helmut Seidl:
On finitely generated monoids of matrices with entries in N. RAIRO Theor. Informatics Appl. 25: 19-38 (1991) - [j2]Andreas Weber, Helmut Seidl:
On the Degree of Ambiguity of Finite Automata. Theor. Comput. Sci. 88(2): 325-349 (1991) - 1990
- [j1]Andreas Weber:
On the Valuedness of Finite Transducers. Acta Informatica 27(8): 749-780 (1990) - [c4]Andreas Weber:
Distance Automata Having Large Finite Distance or Finite Ambiguity. MFCS 1990: 508-515
1980 – 1989
- 1989
- [c3]Andreas Weber:
On the Length of Values in a Finite Transducer. MFCS 1989: 523-533 - 1988
- [c2]Andreas Weber:
A Decomposition Theorem for Finite-Valued Tranducers and an Application to the Equivalence Problem. MFCS 1988: 552-562 - 1986
- [c1]Andreas Weber, Helmut Seidl:
On the Degree of Ambiguity of Finite Automata. MFCS 1986: 620-629
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
