153 citations
- Centrum Wiskunde & InformaticaNL2 papers
- Sobolev Institute of MathematicsRU2 papers
- Alexandru Ioan Cuza UniversityRO1 paper
- Arizona State UniversityUS1 paper
- Boston UniversityUS1 paper
- Centre National de la Recherche ScientifiqueFR1 paper
- Chalmers University of TechnologySE1 paper
- Délégation Paris 7FR1 paper
- DePaul UniversityUS1 paper
- Eindhoven University of TechnologyNL1 paper
- INESC TECPT1 paper
- Institute of Mathematics and InformaticsBG1 paper
Showing 2013Show all
2 papers · 1 filter
cs.DS2013★ 9 cited
Approximating Semi-Matchings in Streaming and in Two-Party Communication
Christian Konrad, Adi Rosén
We study the communication complexity and streaming complexity of approximating unweighted semi-matchings. A semi-matching in a bipartite graph G = (A, B, E), with n = |A|, is a su…
cs.LO2013
Automatic Equivalence Proofs for Non-deterministic Coalgebras
Marcello Bonsangue, Georgiana Caltais, Eugen-Ioan Goriac +3
A notion of generalized regular expressions for a large class of systems modeled as coalgebras, and an analogue of Kleene's theorem and Kleene algebra, were recently proposed by a…