default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Neumann 0001
Person information
- affiliation: Yahoo
- affiliation: IBM
- affiliation: University of Trier
Other persons with the same name
- Andreas Neumann — disambiguation page
- Andreas Neumann 0002 — Institute of Cartography, ETH Zurich
- Andreas Neumann 0003 — École des ponts ParisTech, Champs-sur-Marne, France
- Andreas Neumann 0004 — Technische Universität Berlin, Transport Systems Planning and Transport Telematics, Germany
Other persons with a similar name
- Andreas W. Neumann — Karlsruhe Institute of Technology, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[c8]Mohammad Islam, Angelo K. Huang, Mohamed Battisha, Michelle Chiang, Santhosh Srinivasan, Craig Peters, Andreas Neumann, Alejandro Abdelnur:
Oozie: towards a scalable workflow management system for Hadoop. SWEET@SIGMOD 2012: 4- 2011
- [c7]Christopher Olston, Greg Chiou, Laukik Chitnis, Francis Liu, Yiping Han, Mattias Larsson, Andreas Neumann, Vellanki B. N. Rao, Vijayanand Sankarasubramanian, Siddharth Seth, Chao Tian, Topher ZiCornell, Xiaodan Wang:
Nova: continuous Pig/Hadoop workflows. SIGMOD Conference 2011: 1081-1090
2000 – 2009
- 2008
- [c6]Ori Ben-Yitzhak, Nadav Golbandi, Nadav Har'El, Ronny Lempel, Andreas Neumann, Shila Ofek-Koifman, Dafna Sheinwald, Eugene J. Shekita, Benjamin Sznajder, Sivan Yogev:
Beyond basic faceted search. WSDM 2008: 33-44 - 2004
- [c5]Marcus Fontoura, Eugene J. Shekita, Jason Y. Zien, Sridhar Rajagopalan, Andreas Neumann:
High Performance Index Build Algorithms for Intranet Search Engines. VLDB 2004: 1158-1169 - 2000
- [b1]Andreas Neumann:
Parsing and Quering XML Documents in SML. University of Trier, Germany, 2000
1990 – 1999
- 1999
- [c4]Helmut Seidl, Andreas Neumann:
On Guarding Nested Fixpoints. CSL 1999: 484-498 - 1998
- [c3]Andreas Neumann, Helmut Seidl:
Locating Matches of Tree Patterns in Forests. FSTTCS 1998: 134-145 - [i2]Andreas Neumann, Helmut Seidl:
Locating Matches of Tree Patterns in Forests. Universität Trier, Mathematik/Informatik, Forschungsbericht 98-08 (1998) - 1997
- [c2]Andreas Neumann:
Unambiguity of SGML Content Models - Pushdown Automata Revisited. Developments in Language Theory 1997: 507-518 - [i1]Andreas Neumann:
Unambiguity of SMGL Content Models - Pushdown Automata Revisited. Universität Trier, Mathematik/Informatik, Forschungsbericht 97-05 (1997) - 1996
- [j1]Ulrich Bieker, Andreas Neumann:
Using Logic Programming and Coroutining for Electronic CAD. J. Log. Program. 26(2): 199-215 (1996) - 1993
- [c1]Ulrich Bieker, Andreas Neumann:
Using Logic Programming and Coroutining for VLSI Design. WLP 1993: 10-14
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-04-25 05:59 CEST 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:
