( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The complexity of evaluating tuple generating dependencies.

, и . ICDT, стр. 244-255. ACM, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Sebastian Baum

Optimierung der Pharmakotherapie von geriatrischen Patienten im stationären Bereich durch pharmazeutische Betreuung. Uni Münster, (2009)

Sebastian Birk

Intercalibration of national methods to assess the ecological quality of rivers in Europe using benthic invertebrates and aquatic flora. Uni Duisburg-Essen, (2009)

Sebastian Stange

Market liquidity risk. TU München, (2009)

Sebastian Reick

Internal and external dynamics of a strongly-coupled atom-cavity system. Uni Bonn, (2009)

Sebastian Korff

Untersuchung von Marker-Genen bei Mikrosatelliten-instabilen Tumoren und Entwicklung eines Computer-Verfahrens zur Hochdurchsatzanalyse von Fragmentanalysen aus humanen Mikrosatelliten-instabilen Tumoren. Uni Heidelberg, (2009)
 

Другие публикации лиц с тем же именем

On the Complexity of Hard Enumeration Problems., , , , и . LATA, том 10168 из Lecture Notes in Computer Science, стр. 183-195. (2017)Uncertain Databases in Collaborative Data Management., , , и . MUD, том WP10-04 из CTIT Workshop Proceedings Series, стр. 129-143. Centre for Telematics and Information Technology (CTIT), University of Twente, The Netherlands, (2010)On the Hardness of Counting the Solutions of SPARQL Queries., и . AMW, том 1189 из CEUR Workshop Proceedings, CEUR-WS.org, (2014)The Challenge of Optional Matching in SPARQL., , , , , и . FoIKS, том 9616 из Lecture Notes in Computer Science, стр. 169-190. Springer, (2016)Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection., и . Theory Comput. Syst., 65 (1): 3-41 (2021)DL-Lite and Conjunctive Queries Extended by Optional Matching., , , , и . Description Logics, том 1350 из CEUR Workshop Proceedings, CEUR-WS.org, (2015)On the Complexity of Hard Enumeration Problems, , , , и . (2016)cite arxiv:1610.05493.The complexity of evaluating tuple generating dependencies., и . ICDT, стр. 244-255. ACM, (2011)Efficient Evaluation and Approximation of Well-designed Pattern Trees., , и . PODS, стр. 131-144. ACM, (2015)Static analysis and optimization of semantic web queries., , , и . PODS, стр. 89-100. ACM, (2012)