Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Max Hinne

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Eduard Hoenkamp

> Home > Persons > Max Hinne

Publications

2013
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/jasis/VerberneHHSKHK13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jasis/VerberneHHSKHK13
Suzan Verberne, Maarten van der Heijden, Max Hinne, Maya Sappelli, Saskia Koldijk, Eduard Hoenkamp, Wessel Kraaij:
Reliability and validity of query intent assessments. J. Assoc. Inf. Sci. Technol. 64(11): 2224-2237 (2013)
[c6]
- view
  - electronic edition @ ceur-ws.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/dir/VerberneHHSKHK13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dir/VerberneHHSKHK13
Suzan Verberne, Maarten van der Heijden, Max Hinne, Maya Sappelli, Saskia Koldijk, Eduard Hoenkamp, Wessel Kraaij:
Reliability and Validity of Query Intent Assessments. DIR 2013: 32-33
2010
[c4]
- view
- export record
  dblp key:
  - conf/clef/VerberneHHHKW10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/clef/VerberneHHHKW10
Suzan Verberne, Max Hinne, Maarten van der Heijden, Eduard Hoenkamp, Wessel Kraaij, Theo P. van der Weide:
How does the Library Searcher Behave? A Contrastive Study of Library Search against Ad-hoc Search. CLEF (Notebook Papers/LABs/Workshops) 2010

a service of

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.