( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Querying priced information in databases: The conjunctive case.

, , , , , , , и . ACM Trans. Algorithms, 3 (1): 9:1-9:22 (2007)

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.

Alessandro Alfredo Carmona Martínez

Rodrigo Daniel ˜doœ Carmo

Maria Teresa Carmona Rios

Gisela Carmosin

Ralph Leonardo do Carmo Flores

 

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

Querying Priced Information in Databases: The Conjunctive Case., , и . LATIN, том 2976 из Lecture Notes in Computer Science, стр. 6-15. Springer, (2004)Parallel Implementations of Gusfield's Cut Tree Algorithm., , , , , и . ICA3PP (1), том 7016 из Lecture Notes in Computer Science, стр. 258-269. Springer, (2011)The hardness of recognising poorly matchable graphs and the hunting of the d-snark., , , , и . RAIRO Oper. Res., 58 (3): 2055-2073 (2024)Upper Bounds for the Total Chromatic Number of Join Graphs and Cobipartite Graphs., , и . ICORES, стр. 247-253. SciTePress, (2018)Searching in Random Partially Ordered Sets., , , и . LATIN, том 2286 из Lecture Notes in Computer Science, стр. 278-292. Springer, (2002)Unpopular Addresses Should Not Pollute the Cache., и . WSCAD-SSC, стр. 95-102. IEEE Computer Society, (2012)Querying priced information in databases: The conjunctive case., , , , , , , и . ACM Trans. Algorithms, 3 (1): 9:1-9:22 (2007)Finding stable cliques of PlanetLab nodes., , , , и . DSN, стр. 317-322. IEEE Computer Society, (2010)