Querying priced information in databases: the conjuntive case (2003)
- Authors:
- Autor USP: KOHAYAKAWA, YOSHIHARU - IME
- Unidade: IME
- Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
- Language: Inglês
- Imprenta:
-
ABNT
LABER, Eduardo Sany e KOHAYAKAWA, Yoshiharu. Querying priced information in databases: the conjuntive case. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/34f11876-f8dd-4156-84fc-d3176e3e2932/1332826.pdf. Acesso em: 08 jan. 2026. , 2003 -
APA
Laber, E. S., & Kohayakawa, Y. (2003). Querying priced information in databases: the conjuntive case. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/34f11876-f8dd-4156-84fc-d3176e3e2932/1332826.pdf -
NLM
Laber ES, Kohayakawa Y. Querying priced information in databases: the conjuntive case [Internet]. 2003 ;[citado 2026 jan. 08 ] Available from: https://repositorio.usp.br/directbitstream/34f11876-f8dd-4156-84fc-d3176e3e2932/1332826.pdf -
Vancouver
Laber ES, Kohayakawa Y. Querying priced information in databases: the conjuntive case [Internet]. 2003 ;[citado 2026 jan. 08 ] Available from: https://repositorio.usp.br/directbitstream/34f11876-f8dd-4156-84fc-d3176e3e2932/1332826.pdf - A note on induced cycles in kneser graphs
- On K4-free subgraphs of random graphs
- Ramsey games against a one-armed bandit
- Efficient testing of hypergraphs
- Bounds for optimal coverings
- Almost spanning subgraphs of random graphs after adversarial edge removal
- The chromatic thresholds of graphs
- Percolation in high dimensions
- Small subsets inherit sparse ε-regularity
- An improved upper bound on the density of universal random graphs
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
1332826.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
