Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Alex Badan

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 Stefano Marchesin 0001

> Home > Persons > Alex Badan

Publications

2017
[c2]
- view
  - electronic edition @ ceur-ws.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/edbt/BadanBBBBCCCMMP17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/edbt/BadanBBBBCCCMMP17
Alex Badan, Luca Benvegnù, Matteo Biasetton, Giovanni Bonato, Alessandro Brighente, Alberto Cenzato, Piergiorgio Ceron, Giovanni Cogato, Stefano Marchesin, Alberto Minetto, Leonardo Pellegrina, Alberto Purpura, Riccardo Simionato, Nicolò Soleti, Matteo Tessarotto, Andrea Tonon, Federico Vendramin, Nicola Ferro:
Towards Open-Source Shared Implementations of Keyword-Based Access Systems to Relational Data. EDBT/ICDT Workshops 2017
[c1]
- view
  - electronic edition @ ceur-ws.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/sebd/BadanBBBB0MPPST17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sebd/BadanBBBB0MPPST17
Alex Badan, Luca Benvegnù, Matteo Biasetton, Giovanni Bonato, Alessandro Brighente, Stefano Marchesin, Alberto Minetto, Leonardo Pellegrina, Alberto Purpura, Riccardo Simionato, Matteo Tessarotto, Andrea Tonon, Nicola Ferro:
Keyword-based access to relational data: To reproduce, or to not reproduce? SEBD 2017: 166

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.