The SCEAS System
| |||||||

## Search the dblp DataBase
Lorant Porkolab:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Aleksei V. Fishkin, Klaus Jansen, Lorant Porkolab
**On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks.**[Citation Graph (0, 0)][DBLP] FCT, 2001, pp:495-507 [Conf] - Leonid Khachiyan, Lorant Porkolab
**Computing Integral Points in Convex Semi-algebraic Sets.**[Citation Graph (0, 0)][DBLP] FOCS, 1997, pp:162-171 [Conf] - Aleksei V. Fishkin, Klaus Jansen, Lorant Porkolab
**On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates.**[Citation Graph (0, 0)][DBLP] ICALP, 2001, pp:875-886 [Conf] - Klaus Jansen, Lorant Porkolab
**Polynominal Time Approximation Schemes for General Multiprocessor Job Shop Scheduling.**[Citation Graph (0, 0)][DBLP] ICALP, 2000, pp:878-889 [Conf] - Klaus Jansen, Lorant Porkolab
**On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes.**[Citation Graph (0, 0)][DBLP] IPCO, 2002, pp:329-349 [Conf] - Klaus Jansen, Lorant Porkolab
**Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time.**[Citation Graph (0, 0)][DBLP] ISAAC, 2000, pp:398-409 [Conf] - Klaus Jansen, Lorant Porkolab
**Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring.**[Citation Graph (0, 0)][DBLP] MFCS, 2000, pp:446-455 [Conf] - Klaus Jansen, Lorant Porkolab
**Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks.**[Citation Graph (0, 0)][DBLP] SODA, 1999, pp:490-498 [Conf] - Klaus Jansen, Lorant Porkolab
**Improved Approximation Schemes for Scheduling Unrelated Parallel Machines.**[Citation Graph (0, 0)][DBLP] STOC, 1999, pp:408-417 [Conf] - Klaus Jansen, Lorant Porkolab
**General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time.**[Citation Graph (0, 0)][DBLP] WADS, 1999, pp:110-121 [Conf] - Klaus Jansen, Lorant Porkolab
**Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2002, v:32, n:3, pp:507-520 [Journal] - Leonid Khachiyan, Lorant Porkolab
**Integer Optimization on Convex Semialgebraic Sets.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2000, v:23, n:2, pp:207-224 [Journal] - Klaus Jansen, Lorant Porkolab
**Polynomial time approximation schemes for general multiprocessor job shop scheduling.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2002, v:45, n:2, pp:167-191 [Journal] - Klaus Jansen, Lorant Porkolab
**Improved Approximation Schemes for Scheduling Unrelated Parallel Machines.**[Citation Graph (0, 0)][DBLP] Math. Oper. Res., 2001, v:26, n:2, pp:324-338 [Journal] - Klaus Jansen, Lorant Porkolab
**Computing optimal preemptive schedules for parallel tasks: linear programming approaches.**[Citation Graph (0, 0)][DBLP] Math. Program., 2003, v:95, n:3, pp:617-630 [Journal] - Klaus Jansen, Lorant Porkolab
**Preemptive Scheduling with Dedicated Processors: Applications of Fractional Graph Coloring.**[Citation Graph (0, 0)][DBLP] J. Scheduling, 2004, v:7, n:1, pp:35-48 [Journal] - Klaus Jansen, Lorant Porkolab
**General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2005, v:35, n:3, pp:519-530 [Journal]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |