Jiri Sgall

Navedeno

	Vse	Od leta 2018
Navedbe	5534	1335
indeks h	38	19
indeks i10	85	38

280

140

210

19941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320 26 37 73 79 64 95 110 117 160 177 202 233 208 238 262 239 228 229 259 256 246 257 230 266 215 233 256 242 119

Javni dostop

Prikaži vse

9 člankov

0 člankov

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Marek ChrobakUniversity of California at RiversidePreverjeni e-poštni naslov na cs.ucr.edu
Gerhard WoegingerProfessor of Computer Science, RWTH AachenPreverjeni e-poštni naslov na cs.rwth-aachen.de
Leah EpsteinUniversity of HaifaPreverjeni e-poštni naslov na math.haifa.ac.il
Łukasz JeżAssistant Professor of Computer Science, University of WrocławPreverjeni e-poštni naslov na cs.uni.wroc.pl
Pavel VeselýComputer Science Institute of Charles University, Prague, Czech RepublicPreverjeni e-poštni naslov na iuuk.mff.cuni.cz
Rob van SteeDepartment of Mathematics, University of Siegen, GermanyPreverjeni e-poštni naslov na uni-siegen.de
Martin BöhmAssistant professor, University of Wrocław, PolandPreverjeni e-poštni naslov na cs.uni.wroc.pl
Leen StougieSenior Researcher CWI, Prof. of Operations Research Vrije Universiteit, AmsterdamPreverjeni e-poštni naslov na cwi.nl
György DósaUniversity of Pannonia, Mathematical DepartmentPreverjeni e-poštni naslov na almos.uni-pannon.hu
Anja FeldmannDirektor, Max Planck Institut für Informatik, Saarland Informatics Campus, Saarland UniversityPreverjeni e-poštni naslov na mpi-inf.mpg.de
Petr KolmanCharles University in PraguePreverjeni e-poštni naslov na kam.mff.cuni.cz
Marcin BienkowskiUniversity of WroclawPreverjeni e-poštni naslov na cs.uni.wroc.pl
Russell ImpagliazzoUC, San DiegoPreverjeni e-poštni naslov na eng.ucsd.edu
Dan BonehProfessor of Computer Science, Stanford UniversityPreverjeni e-poštni naslov na cs.stanford.edu
Kirk PruhsProfessor of Computer Science, University of PittsburghPreverjeni e-poštni naslov na cs.pitt.edu
Eric TorngMichigan State UniversityPreverjeni e-poštni naslov na cse.msu.edu
Stefano LeonardiProfessor of Computer Science, Sapienza University of RomePreverjeni e-poštni naslov na dis.uniroma1.it
Alberto Marchetti-SpaccamelaProfessor of Computer Engineering, Sapienza University of RomePreverjeni e-poštni naslov na diag.uniroma1.it
Jarek ByrkaUniversity of WroclawPreverjeni e-poštni naslov na cs.uni.wroc.pl
Yossi AzarTel Aviv UniversityPreverjeni e-poštni naslov na post.tau.ac.il

Spremljaj

Jiri Sgall

Computer Science Institute of Charles University

Preverjeni e-poštni naslov na iuuk.mff.cuni.cz - Domača stran

computer science approximation algorithms online algorithms scheduling complexity theory


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
On-line scheduling J Sgall Online algorithms: The state of the art, 196-231, 2005	447	2005
Online Scheduling. K Pruhs, J Sgall, E Torng Handbook of Scheduling, 2004	409*	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	379	2000
On the computational power of DNA D Boneh, C Dunworth, RJ Lipton, J Sgall Discrete Applied Mathematics 71 (1-3), 79-94, 1996	321	1996
First Fit bin packing: A tight analysis G Dósa, J Sgall 30th International symposium on theoretical aspects of computer science …, 2013	167	2013
Dynamic scheduling on parallel machines A Feldmann, J Sgall, SH Teng Theoretical Computer Science 130 (1), 49-72, 1994	156	1994
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	144	1999
Solution of David Gale's lion and man problem J Sgall Theoretical Computer Science 259 (1-2), 663-670, 2001	139	2001
Semi-online scheduling with decreasing job sizes S Seiden, J Sgall, G Woeginger Operations Research Letters 27 (5), 215-221, 2000	128	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	119	1996
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	106	2001
Making DNA computers error resistant D Boneh, RJ Lipton DNA Based Computers, 163-170, 1996	101	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	91	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	86	2006
Ancient and New Algorithms for Load Balancing in the l _p Norm A Avidor, Y Azar, J Sgall Algorithmica 29, 422-441, 2001	80	2001
Communication complexity towards lower bounds on circuit depth J Edmonds, R Impagliazzo, S Rudich, J Sgall Computational Complexity 10 (3), 210-246, 2001	79	2001
Communication complexity towards lower bounds on circuit depth J Edmonds, R Impagliazzo, S Rudich, J Sgall Computational Complexity 10 (3), 210-246, 2001	79	2001
A lower bound for randomized on-line multiprocessor scheduling J Sgall Information Processing Letters 63 (1), 51-55, 1997	79	1997
Boolean circuits, tensor ranks, and communication complexity P Pudlák, V Rödl, J Sgall SIAM Journal on Computing 26 (3), 605-633, 1997	79	1997
Optimal online scheduling of parallel jobs with dependencies A Feldmann, MY Kao, J Sgall, SH Teng Proceedings of the twenty-fifth annual ACM symposium on Theory of computing …, 1993	78	1993

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji