Person:1390868: Difference between revisions

Latest revision as of 04:28, 13 December 2023

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q5501806	2015-08-14	Paper
Probabilistic analysis for scheduling with conflicts	2008-05-28	Paper
Communication-aware processor allocation for supercomputers: Finding point sets of small average distance	2008-04-03	Paper
Scheduling with conflicts on bipartite and interval graphs	2007-12-20	Paper
Algorithms and Data Structures	2006-10-25	Paper
https://portal.mardi4nfdi.de/entity/Q4801181	2003-04-07	Paper
https://portal.mardi4nfdi.de/entity/Q4952606	2000-10-23	Paper
The undecidability of the unrestricted modified edit distance	1998-07-22	Paper
https://portal.mardi4nfdi.de/entity/Q4875172	1996-04-28	Paper
https://portal.mardi4nfdi.de/entity/Q4763337	1995-04-11	Paper

This page was built for person: Vitus J. Leung

Revision as of 10:34, 7 October 2023 view source Import231006081045 (talk \| contribs) Bots 963,540 edits Created automatically from import231006081045	Latest revision as of 04:28, 13 December 2023 view source AuthorDisambiguator (talk \| contribs) Bots, Administrators 1,238,488 edits m AuthorDisambiguator moved page Vitus J. Leung to Vitus J. Leung: Duplicate
(No difference)