Maurizio Talamo

From MaRDI portal
Person:169306

Available identifiers

zbMath Open talamo.maurizioMaRDI QIDQ169306

List of research outcomes





PublicationDate of PublicationType
Competitive algorithms for the on-line traveling salesman2022-12-16Paper
Serving requests with on-line routing2022-12-09Paper
https://portal.mardi4nfdi.de/entity/Q30984412011-11-17Paper
Optimal centralized algorithms for store-and-forward deadlock avoidance2003-10-16Paper
https://portal.mardi4nfdi.de/entity/Q47925402003-02-17Paper
Representing graphs implicitly using almost optimal space2002-08-24Paper
Algorithms for the on-line travelling salesman2002-02-19Paper
Algorithms for the relaxed online bin-packing model2001-03-19Paper
https://portal.mardi4nfdi.de/entity/Q45252692001-01-21Paper
https://portal.mardi4nfdi.de/entity/Q45252642001-01-21Paper
An Efficient Data Structure for Lattice Operations1999-10-28Paper
https://portal.mardi4nfdi.de/entity/Q42327861999-03-15Paper
A data structure for lattice representation1998-07-23Paper
Preserving approximation in the min-weighted set cover problem1997-06-30Paper
The Set Union Problem with Unlimited Backtracking1994-12-21Paper
A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS1994-11-06Paper
An efficient implicit data structure for relation testing and searching in partially ordered sets1993-08-30Paper
A new model for large memories1993-05-24Paper
A pointer-free data structure for merging heaps and min-max heaps1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q47126601992-06-25Paper
The set union problem with dynamic weighted backtracking1991-01-01Paper
On locally presented posets1990-01-01Paper
A partially persistent data structure for the set-union problem1990-01-01Paper
On the number of arithmetical operations for finding Fibonacci numbers1989-01-01Paper
Worst-case analysis of the set-union problem with extended backtracking1989-01-01Paper
An application of $m$-ary trees to the design of data structures for geometric searching problems1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33552231989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37874781988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37673861987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37835931987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37490731986-01-01Paper
A parametric analysis of the largest induced tree problem in random graphs1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36970301985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37402571985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33419281983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36740561983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33232851983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30412381983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33419291983-01-01Paper

Research outcomes over time

This page was built for person: Maurizio Talamo