#### Filter Results:

#### Publication Year

2000

2014

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

- Marcelo Côrtes Neri, Emily Gustafsson-Wright, Guilherme Sedlacek, Daniela Ribeiro Da Costa, Alexandre Pinto
- 2000

This paper evaluates the long-run effects of economic instability. In particular, we study the impact of idiosyncratic shocks to father's income on children's human capital accumulation variables such as school drop-outs, repetition rates and domestic and non-domestic labor. Although, the problem of child labor in Brazil has declined greatly during the last… (More)

Kolmogorov Complexity measures the amount of information in a string by the size of the smallest program that generates that string. Antunes, Fortnow, van Melkebeek, and Vinodchandran captured the notion of useful information by computational depth, the difference between the polynomial-time-bounded Kolmogorov complexity and traditional Kolmogorov… (More)

In the information theoretic world, entropy is both the measure of randomness in a source and a bound for the compression achievable for that source by any encoding scheme. But when we must restrict ourselves to efficient schemes, entropy no longer captures these notions well. For example, there are distributions with very low entropy that nonetheless look… (More)

- Alexandre Pinto, Hugo Miranda, Luís Rodrigues
- 2001

This paper reports a practical experience of implementing a group communication service using a protocol composition framework. Specifically, the paper describes the implementation of a LightWeight Groups (LWG) service on the Ensemble system. This is an interesting case-study because the LWG service is very demanding in terms of protocol composition since… (More)

In [3] the authors give the first mathematical formalization of an unconditionally secure commitment scheme. Their construction has some similarities to one used to build authentication codes, so they raise the question whether there is some relation between commitment schemes and authentication schemes. They conjecture that authentication schemes with… (More)

This paper addresses the scenario of multi-release anonymization of datasets. We consider dynamic datasets where data can be inserted and deleted, and view this scenario as a case where each release is a small subset of the dataset corresponding, for example, to the results of a query. Compared to multiple releases of the full database, this has the obvious… (More)

A variant of public key encryption that promises efficiency gains due to batch processing is multi-recipient public key encryption (MR-PKE). Precisely, in MR-PKE, a dedicated encryption routine takes a vector of messages and a vector of public keys and outputs a vector of ciphertexts, where the latter can be decrypted individually, as in regular PKE. In… (More)