9+ open-access research outputs.
We develop an algorithmic framework to incorporate "ex-ante" constraints on outcomes (that hold only on average) into stateful sequential search with costly inspection. Our framework encompasses the c…
Every CSP(B) for a finite structure B is either in P or it is NP-complete but the proofs of the finite-domain CSP dichotomy by Andrei Bulatov and Dimitryi Zhuk not only show the computational complexi…
The traditional teaching of software engineering is focused on technical skills. Active strategies, where students experience content and interact with reality, are effective. The market demands new s…
We study the problem of approximately counting cliques and near cliques in a graph, where the access to the graph is only available through crawling its vertices; thus typically seeing only a small po…
We study a general Markov game with metric switching costs: in each round, the player adaptively chooses one of several Markov chains to advance with the objective of minimizing the expected cost for …
This article offers guidance on managing the infodemic in digital media, based on the experiences of news agencies at a time when an increase in journalistic production is coinciding with the response…
The 8th edition of the European Conference on Python in Science, EuroSciPy was held for the second time in the beautiful city of Cambridge, UK from August, 26th to 29th, 2014. More than 200 participan…
The problem of approximate string matching is important in many different areas such as computational biology, text processing and pattern recognition. A great effort has been made to design efficient…
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We develop an 8-competi…
Free open-access publishing with Google Scholar indexing.
Submission Guide →