Martín Farach-Colton

Available identifiers

zbMath Open farach-colton.martinMaRDI QIDQ247168

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6126243	2024-04-09	Paper
On the optimal time/space tradeoff for hash tables	2023-12-08	Paper
https://portal.mardi4nfdi.de/entity/Q5874307	2023-02-07	Paper
https://portal.mardi4nfdi.de/entity/Q5875468	2023-02-03	Paper
Dynamic Windows Scheduling with Reallocation	2022-09-06	Paper
https://portal.mardi4nfdi.de/entity/Q5091039	2022-07-21	Paper
Optimal Hashing in External Memory	2021-07-28	Paper
Flushing Without Cascades	2021-02-02	Paper
Achieving optimal backlog in multi-processor cup games	2020-01-30	Paper
Optimal Ball Recycling	2019-10-15	Paper
Cost-Oblivious Storage Reallocation	2018-11-05	Paper
Ordinal embeddings of minimum relaxation	2018-11-05	Paper
Parallel lookups in string indexes	2018-10-17	Paper
Cross-Referenced Dictionaries and the Limits of Write Optimization	2018-07-16	Paper
Fault-tolerant aggregation: flow-updating meets mass-distribution	2017-09-04	Paper
The I/O Complexity of Computing Prime Tables	2016-05-03	Paper
Tight Approximations of Degeneracy in Large Graphs	2016-05-03	Paper
Exact sublinear binomial sampling	2016-02-19	Paper
On the Complexity of Computing Prime Tables	2016-01-11	Paper
Finding Articulation Points of Large Graphs in Linear Time	2015-10-30	Paper
Reallocation problems in scheduling	2015-10-19	Paper
Initializing sensor networks of non-uniform density in the weak sensor model	2015-09-03	Paper
Bootstrapping a hop-optimal network in the weak sensor model	2014-11-18	Paper
https://portal.mardi4nfdi.de/entity/Q2921724	2014-10-13	Paper
The Batched Predecessor Problem in External Memory	2014-10-08	Paper
Computing the Degeneracy of Large Graphs	2014-03-31	Paper
Exact Sublinear Binomial Sampling	2014-01-14	Paper
Optimal memory-aware sensor network gossiping (or how to break the broadcast lower bound)	2013-03-04	Paper
Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism	2012-06-29	Paper
On the complexity of ordinal clustering	2012-05-30	Paper
Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model	2009-02-17	Paper
Fast and compact regular expression matching	2009-01-08	Paper
Lower Bounds for Clear Transmissions in Radio Networks	2008-09-18	Paper
A Linear Delay Algorithm for Building Concept Lattices	2008-06-17	Paper
Sensor Network Gossiping or How to Break the Broadcast Lower Bound	2008-05-27	Paper
INSERTION SORT is \(O(n \log n)\)	2007-02-13	Paper
Algorithms – ESA 2005	2006-06-27	Paper
Cache-Oblivious B-Trees	2006-06-01	Paper
Lowest common ancestors in trees and directed acyclic graphs	2005-12-08	Paper
https://portal.mardi4nfdi.de/entity/Q4828922	2004-11-29	Paper
https://portal.mardi4nfdi.de/entity/Q3044351	2004-08-11	Paper
The level ancestor problem simplified	2004-08-10	Paper
https://portal.mardi4nfdi.de/entity/Q4411353	2003-07-08	Paper
https://portal.mardi4nfdi.de/entity/Q4411355	2003-07-08	Paper
https://portal.mardi4nfdi.de/entity/Q4411356	2003-07-08	Paper
Fast, fair and frugal bandwidth allocation in ATM networks	2002-06-17	Paper
https://portal.mardi4nfdi.de/entity/Q2768292	2002-01-30	Paper
https://portal.mardi4nfdi.de/entity/Q4508365	2001-05-06	Paper
An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees	2001-03-19	Paper
On Local Register Allocation	2000-11-05	Paper
https://portal.mardi4nfdi.de/entity/Q4252277	1999-06-17	Paper
Optimal parallel two dimensional text searching on a CREW PRAM	1999-03-25	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Martín Farach-Colton