Search results
- 1.0405292 - UIVT-O 330614 RIV US eng J - Journal Article
Šíma, Jiří - Sgall, Jiří
On the Non-Learnability of a Single Spiking Neuron.
[O nenaučitelnosti jednoho spiking neuronu.]
Neural Computation. Roč. 17, č. 12 (2005), s. 2635-2647. ISSN 0899-7667. E-ISSN 1530-888X
R&D Projects: GA ČR GA201/02/1456; GA AV ČR 1ET100300517; GA MŠMT LN00A056; GA MŠMT(CZ) 1M0545
Institutional research plan: CEZ:AV0Z10300504; CEZ:AV0Z10190503
Keywords : spiking neuron * consistency problem * NP-completness * PAC model * robust learning * representation problem
Subject RIV: BA - General Mathematics
Impact factor: 2.591, year: 2005
Permanent Link: http://hdl.handle.net/11104/0125473File Download Size Commentary Version Access 0405292.pdf 1 366.7 KB Author´s preprint open-access - 2.0403463 - UIVT-O 20020001 RIV DE eng J - Journal Article
Savický, Petr - Sgall, Jiří
DNF Tautologies with a Limited Number of Occurrences of Every Variable.
Theoretical Computer Science. Roč. 238, 1-2 (2000), s. 495-498. ISSN 0304-3975. E-ISSN 1879-2294
R&D Projects: GA ČR GA201/98/0717; GA AV ČR IAA1019602; GA ČR GA201/97/P038; GA MŠMT ME 103
Institutional research plan: AV0Z1030915
Keywords : disjunctive normal form * tautology * occurences of variable
Subject RIV: BA - General Mathematics
Impact factor: 0.417, year: 2000
Permanent Link: http://hdl.handle.net/11104/0123768 - 3.0353479 - MÚ 2011 RIV NL eng J - Journal Article
Chrobak, M. - Sgall, Jiří
Three results on frequency assignment in linear cellular networks.
Theoretical Computer Science. Roč. 411, č. 1 (2010), s. 131-137. ISSN 0304-3975. E-ISSN 1879-2294
R&D Projects: GA MŠMT(CZ) 1M0545; GA AV ČR IAA100190902
Keywords : frequency assignment * approximation algorithms * online algorithms
Subject RIV: BA - General Mathematics
Impact factor: 0.838, year: 2010
http://www.sciencedirect.com/science/article/pii/S0304397509006574
Permanent Link: http://hdl.handle.net/11104/0192723 - 4.0338976 - MÚ 2010 RIV NL eng J - Journal Article
Sgall, Jiří - Shachnai, H. - Tamir, T.
Periodic scheduling with obligatory vacations.
Theoretical Computer Science. Roč. 410, 47-49 (2009), s. 5112-5121. ISSN 0304-3975. E-ISSN 1879-2294
R&D Projects: GA MŠMT(CZ) 1M0545; GA AV ČR IAA100190902
Keywords : periodic scheduling
Subject RIV: IN - Informatics, Computer Science
Impact factor: 0.943, year: 2009
Permanent Link: http://hdl.handle.net/11104/0182617File Download Size Commentary Version Access Sgall3.pdf 1 578.1 KB Publisher’s postprint require - 5.0338975 - MÚ 2010 RIV US eng J - Journal Article
Chrobak, M. - Hurand, M. - Sgall, Jiří
Algorithms for testing fault-tolerance of sequenced jobs.
Journal of Scheduling. Roč. 12, č. 5 (2009), s. 501-515. ISSN 1094-6136. E-ISSN 1099-1425
R&D Projects: GA MŠMT(CZ) 1M0545; GA AV ČR IAA100190902; GA AV ČR IAA1019401
Keywords : sequencing algorithms * fault-tolerance * dynamic programming
Subject RIV: IN - Informatics, Computer Science
Impact factor: 1.265, year: 2009
Permanent Link: http://hdl.handle.net/11104/0182616File Download Size Commentary Version Access Sgall1.pdf 1 579 KB Publisher’s postprint require - 6.0334960 - MÚ 2010 RIV US eng J - Journal Article
Ebenlendr, Tomáš - Jawor, W. - Sgall, Jiří
Preemptive Online Scheduling: Optimal Algorithms for All Speeds.
[Preemptivní online rozvrhování: optimální algoritmy pro všechny rychlosti.]
Algorithmica. Roč. 53, č. 4 (2009), s. 504-522. ISSN 0178-4617. E-ISSN 1432-0541
R&D Projects: GA MŠMT(CZ) 1M0545; GA ČR GA201/05/0124; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : anline algorithms * scheduling
Subject RIV: IN - Informatics, Computer Science
Impact factor: 0.917, year: 2009
Permanent Link: http://hdl.handle.net/11104/0179564File Download Size Commentary Version Access Ebenlendr1.pdf 1 435.2 KB Publisher’s postprint require - 7.0318591 - MÚ 2009 RIV NL eng J - Journal Article
Král´, D. - Tichý, T. - Sgall, Jiří
Randomized Strategies for the Plurality Problem.
[Pravděpodobnostní strategie pro problém plurality.]
Discrete Applied Mathematics. Roč. 156, č. 17 (2008), s. 3305-3311. ISSN 0166-218X. E-ISSN 1872-6771
R&D Projects: GA ČR GA201/05/0124
Institutional research plan: CEZ:AV0Z10190503
Keywords : concrete complexity * randomized algorithms
Subject RIV: BA - General Mathematics
Impact factor: 0.783, year: 2008
Permanent Link: http://hdl.handle.net/11104/0167963File Download Size Commentary Version Access Sgall1.pdf 1 413.1 KB Publisher’s postprint require - 8.0318590 - MÚ 2009 RIV US eng J - Journal Article
Bruhn, H. - Černý, J. - Hall, A. - Kolman, P. - Sgall, Jiří
Single source multiroute flows and cuts on uniform capacity networks.
[Multikomoditní toky a řezy v sítích s uniformní kapacitou a jedním zdrojem.]
Theory of Computing. Roč. 4, č. 1 (2008), s. 1-20. ISSN 1557-2862. E-ISSN 1557-2862
R&D Projects: GA ČR GA201/05/0124; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : graphs * multi-route flow * paths
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0167962File Download Size Commentary Version Access Sgall.pdf 1 307.8 KB Publisher’s postprint open-access - 9.0175332 - MU-W 20030084 RIV US eng J - Journal Article
Chrobak, M. - Epstein, L. - Noga, J. - Sgall, Jiří - van Stee, R. - Tichý, Tomáš - Vakhania, N.
Preemptive scheduling in overloaded systems.
Journal of Computer and System Sciences. Roč. 67, č. 1 (2003), s. 183-197. ISSN 0022-0000. E-ISSN 1090-2724
R&D Projects: GA ČR GA201/01/1195; GA MŠMT ME 476; GA AV ČR IAA1019901; GA MŠMT LN00A056
Institutional research plan: CEZ:AV0Z1019905; CEZ:AV0Z1019905
Keywords : scheduling * online algorithms * benefit
Subject RIV: BA - General Mathematics
Impact factor: 0.795, year: 2003
Permanent Link: http://hdl.handle.net/11104/0072316 - 10.0175225 - MU-W 20020113 RIV CH eng J - Journal Article
Edmonds, J. - Impagliazzo, R. - Rudich, S. - Sgall, Jiří
Communication complexity towards lower bounds on circuit depth.
Computational Complexity. Roč. 10, č. 3 (2001), s. 210-246. ISSN 1016-3328. E-ISSN 1420-8954
R&D Projects: GA AV ČR IAA1019602; GA AV ČR IAA1019901; GA ČR GA201/97/P038; GA ČR GA201/01/1195; GA MŠMT ME 103
Keywords : communication complexity%lower bounds
Subject RIV: BA - General Mathematics
Impact factor: 0.448, year: 2001
Permanent Link: http://hdl.handle.net/11104/0072210File Download Size Commentary Version Access Sgall1.pdf 1 556.3 KB Publisher’s postprint require