default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGerhard Trippen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j5]Wei Chen, Sifeng Liu
, Wally J. Smieliauskas, Gerhard Trippen:
Influence factors analysis of online auditing performance assessment: A combined use between AHP and GIA. Kybernetes 41(5/6): 587-598 (2012)- 2011
- [c9]Wei Chen, Wally J. Smieliauskas, Gerhard Trippen:
An audit evidence gathering model in online auditing environments. SMC 2011: 1448-1452 - 2010
- [j4]Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen:
The Tourist in the Shopping Arcade. J. Univers. Comput. Sci. 16(5): 676-685 (2010)
2000 – 2009
- 2009
- [c8]Gerhard Trippen:
Plans, Patterns, and Move Categories Guiding a Highly Selective Search. ACG 2009: 111-122 - 2008
- [j3]Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen:
Competitive Online Approximation of the Optimal Search Ratio. SIAM J. Comput. 38(3): 881-898 (2008) - 2007
- [j2]Yo-Sub Han, Gerhard Trippen, Derick Wood:
Simple-Regular Expressions and Languages. J. Autom. Lang. Comb. 12(1-2): 181-194 (2007) - 2006
- [i2]Andrea Eubeler, Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen:
Competitive Online Searching for a Ray in the Plane. Robot Navigation 2006 - 2005
- [c7]Rudolf Fleischer, Gerhard Trippen:
On the Effectiveness of Visualizations in a Theory of Computing Course. Cognitive Systems 2005: 15-24 - [c6]Yo-Sub Han, Gerhard Trippen, Derick Wood:
Simple-Regular Expressions and Languages. DCFS 2005: 146-157 - [c5]Rudolf Fleischer, Gerhard Trippen:
Exploring an Unknown Graph Efficiently. ESA 2005: 11-22 - [i1]Andrea Eubeler, Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen:
Competitive online searching for a ray in the plane. EuroCG 2005: 107-110 - 2004
- [c4]Rudolf Fleischer, Gerhard Trippen:
Kayles on the Way to the Stars. Computers and Games 2004: 232-245 - [c3]Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen:
Competitive Online Approximation of the Optimal Search Ratio. ESA 2004: 335-346 - [e1]Rudolf Fleischer, Gerhard Trippen:
Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings. Lecture Notes in Computer Science 3341, Springer 2004, ISBN 3-540-24131-0 [contents] - 2003
- [c2]Rudolf Fleischer, Gerhard Trippen:
Experimental Studies of Graph Traversal Algorithms. WEA 2003: 120-133 - 2001
- [j1]Rudolf Fleischer, Kathleen Romanik, Sven Schuierer, Gerhard Trippen:
Optimal Robot Localization in Trees. Inf. Comput. 171(2): 224-247 (2001) - 2000
- [c1]Rudolf Fleischer, Gerhard Trippen:
Optimal robot localization in trees. SCG 2000: 373-374
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-24 22:58 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:
