Jiri Sgall

Citirano

	Sve	Od 2019.
Citati	5921	1405
H-indeks	40	19
i10-indeks	88	39

280

140

210

199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202425 28 39 75 81 74 105 113 114 169 169 191 238 209 253 264 234 240 234 254 260 239 253 222 272 221 233 261 240 216 230

Javni pristup

Prikaži sve

9 članaka

0 članaka

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

Marek ChrobakUniversity of California at RiversidePotvrđena adresa e-pošte na cs.ucr.edu
Gerhard WoegingerProfessor of Computer Science, RWTH AachenPotvrđena adresa e-pošte na cs.rwth-aachen.de
Leah EpsteinUniversity of HaifaPotvrđena adresa e-pošte na math.haifa.ac.il
Łukasz JeżAssistant Professor of Computer Science, University of WrocławPotvrđena adresa e-pošte na cs.uni.wroc.pl
Pavel Pudlákresearcher, Institute of Mathematics, CASPotvrđena adresa e-pošte na math.cas.cz
Pavel VeselýComputer Science Institute of Charles University, Prague, Czech RepublicPotvrđena adresa e-pošte na iuuk.mff.cuni.cz
Rob van SteeDepartment of Mathematics, University of Siegen, GermanyPotvrđena adresa e-pošte na uni-siegen.de
Martin BöhmAssistant professor, University of Wrocław, PolandPotvrđena adresa e-pošte na cs.uni.wroc.pl
Leen StougieSenior Researcher CWI, Prof. of Operations Research Vrije Universiteit, AmsterdamPotvrđena adresa e-pošte na cwi.nl
Petr KolmanCharles University in PraguePotvrđena adresa e-pošte na kam.mff.cuni.cz
György DósaUniversity of Pannonia, Mathematical DepartmentPotvrđena adresa e-pošte na almos.uni-pannon.hu
Marcin BienkowskiUniversity of WroclawPotvrđena adresa e-pošte na cs.uni.wroc.pl
Anja FeldmannDirektor, Max Planck Institut für Informatik, Saarland Informatics Campus, Saarland UniversityPotvrđena adresa e-pošte na mpi-inf.mpg.de
Stefano LeonardiProfessor of Computer Science, Sapienza University of RomePotvrđena adresa e-pošte na dis.uniroma1.it
Alberto Marchetti-SpaccamelaProfessor of Computer Engineering, Sapienza University of RomePotvrđena adresa e-pošte na diag.uniroma1.it
Jarek ByrkaUniversity of WroclawPotvrđena adresa e-pošte na cs.uni.wroc.pl
Kirk PruhsProfessor of Computer Science, University of PittsburghPotvrđena adresa e-pošte na cs.pitt.edu
Eric TorngMichigan State UniversityPotvrđena adresa e-pošte na cse.msu.edu
Dan BonehProfessor of Computer Science, Stanford UniversityPotvrđena adresa e-pošte na cs.stanford.edu
Lukáš FolwarcznýComputer Science Institute of Charles UniversityPotvrđena adresa e-pošte na iuuk.mff.cuni.cz

Prati

Jiri Sgall

Computer Science Institute of Charles University

Potvrđena adresa e-pošte na iuuk.mff.cuni.cz - Početna stranica

computer science approximation algorithms online algorithms scheduling complexity theory


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	Citirano Citirano	Godina
On-line scheduling J Sgall Online algorithms: The state of the art, 196-231, 2005	452	2005
Online Scheduling. K Pruhs, J Sgall, E Torng Handbook of Scheduling, 2004	436*	2004
Multiprocessor scheduling with rejection Y Bartal, S Leonardi, A Marchetti-Spaccamela, J Sgall, L Stougie SIAM Journal on Discrete Mathematics 13 (1), 64-78, 2000	411	2000
On the computational power of DNA D Boneh, C Dunworth, RJ Lipton, J Sgall Discrete Applied Mathematics 71 (1-3), 79-94, 1996	335	1996
First Fit bin packing: A tight analysis G Dósa, J Sgall 30th International symposium on theoretical aspects of computer science …, 2013	196	2013
Lower bounds for the polynomial calculus and the Gröbner basis algorithm R Impagliazzo, P Pudlák, J Sgall Computational Complexity 8 (2), 127-144, 1999	160	1999
Dynamic scheduling on parallel machines A Feldmann, J Sgall, SH Teng Theoretical Computer Science 130 (1), 49-72, 1994	159	1994
Solution of David Gale's lion and man problem J Sgall Theoretical Computer Science 259 (1-2), 663-670, 2001	148	2001
Semi-online scheduling with decreasing job sizes S Seiden, J Sgall, G Woeginger Operations Research Letters 27 (5), 215-221, 2000	133	2000
Proof complexity in algebraic systems and bounded depth Frege systems with modular counting S Buss, R Impagliazzo, J Krajíček, P Pudlák, AA Razborov, J Sgall Computational Complexity 6, 256-298, 1996	131	1996
Graph balancing: a special case of scheduling unrelated parallel machines T Ebenlendr, M Krčál, J Sgall Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008	125*	2008
Randomized on‐line scheduling on two uniform machines L Epstein, J Noga, S Seiden, J Sgall, G Woeginger Journal of Scheduling 4 (2), 71-92, 2001	114	2001
Making DNA computers error resistant D Boneh, C Dunworth, RJ Lipton, J Sgall DNA Based Computers, 163-170, 1996	104	1996
Approximation schemes for scheduling on uniformly related and identical parallel machines L Epstein\thanks {School of Computer Science, The Interdisciplinary Center ... Algorithmica 39, 43-57, 2004	94	2004
Online competitive algorithms for maximizing weighted throughput of unit jobs FYL Chin, M Chrobak, SPY Fung, W Jawor, J Sgall, T Tichý Journal of Discrete Algorithms 4 (2), 255-276, 2006	93	2006
On the complexity of cake cutting GJ Woeginger, J Sgall Discrete Optimization 4 (2), 213-220, 2007	89	2007
Communication complexity towards lower bounds on circuit depth J Edmonds, R Impagliazzo, S Rudich, J Sgall Computational Complexity 10 (3), 210-246, 2001	88	2001
Optimal analysis of best fit bin packing G Dósa, J Sgall International Colloquium on Automata, Languages, and Programming, 429-441, 2014	86	2014
Boolean circuits, tensor ranks, and communication complexity P Pudlák, V Rödl, J Sgall SIAM Journal on Computing 26 (3), 605-633, 1997	83	1997
A lower bound for randomized on-line multiprocessor scheduling J Sgall Information Processing Letters 63 (1), 51-55, 1997	82	1997

Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.

Članci 1–20

Godišnji broj citata

Dvostruki navodi

Spojeni navodi

Dodavanje suautoraSuautori

Prati

Citirano

Suautori