About: Center of excellence - Institute for theoretical computer science (CE-ITI)

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Center of excellence - Institute for theoretical computer science (CE-ITI) Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Projekt, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	http://linked.opendata.cz/ontology/domain/vavai/Projekt
rdfs:seeAlso	http://www.isvav.cz/projectDetail.do?rowId=GBP202/12/G061
Description	Center of Excellence - Institute for Theoretical Computer Science (CE-ITI) is a research center for theoretical computer science and discrete mathematics. CE-ITI aims at becoming an international leader recognized world-wide, and also a driving force of Czech theoretical computer science and discrete mathematics. To achieve that, CE-ITI includes best professors, young researchers, and students from several top institutes in the Czech Republic, and integrates the following key activities: 1) Conducting research of highest quality, addressing major challenges and open problems, and initiating new lines of research. 2) Educating a new generation of researchers and active searching for new talents. 3) Coordinating and fostering international cooperation, strengthening the standing of Czech computer science and mathematics in world-wide context. (en) Centrum excelence - Institut teoretické informatiky (CE-ITI) je výzkumné centrum orientované na teoretickou informatiku a diskrétní matematiku. Cílem CE-ITI je být vůdčí a respektovanou výzkumnou institucí v celosvětovém kontextu a hybnou silou české teoretické informatiky a diskrétní matematiky. Za tímto účelem je v CE-ITI propojena kapacita nejlepších profesorů, mladých výzkumníků a studentů z vynikajících českých institucí. Klíčové aktivity CE-ITI lze shrnout následovně: 1) Výzkum nejvyšší kvality; speciální pozornost je věnována důležitým otevřeným problémům, aktuálním trendům a novým výzkumným směrům. 2) Výchova nové generace vědců, vyhledávání a podpora talentů. 3) Koordinace a kultivace mezinárodní spolupráce, posilování postavení české informatiky a matematiky v celosvětovém kontextu.
Title	Center of excellence - Institute for theoretical computer science (CE-ITI) (en) Centrum excelence - Institut teoretické informatiky (CE-ITI)
skos:notation	GBP202/12/G061
http://linked.open...avai/cep/aktivita	Projects for promotion of excellence in basic research
http://linked.open...kovaStatniPodpora	http://linked.opendata.cz/resource/domain/vavai/projekt/GBP202%2F12%2FG061/celkovaStatniPodpora
http://linked.open...ep/celkoveNaklady	http://linked.opendata.cz/resource/domain/vavai/projekt/GBP202%2F12%2FG061/celkoveNaklady
http://linked.open...datumDodatniDoRIV	2015-02-09 (xsd:date)
http://linked.open...i/cep/druhSouteze	VS - Veřejná soutěž ve výzkumu a vývoji
http://linked.open...ep/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open.../cep/fazeProjektu	101113294
http://linked.open...ai/cep/hlavniObor	IN - Informatika
http://linked.open...vai/cep/kategorie	ZV - Základní výzkum
http://linked.open.../cep/klicovaSlova	combinatorics graph theory mathematical logic discrete geometry theory of algorithms computational (en)
http://linked.open...ep/partnetrHlavni	Matematicko-fyzikální fakulta
http://linked.open...inujicichPrijemcu	0 (xsd:int)
http://linked.open...cep/pocetPrijemcu	1 (xsd:int)
http://linked.open...ocetSpoluPrijemcu	4 (xsd:int)
http://linked.open.../pocetVysledkuRIV	164 (xsd:int)
http://linked.open...enychVysledkuVRIV	164 (xsd:int)
http://linked.open...lneniVMinulemRoce	2014-04-07 (xsd:date)
http://linked.open.../prideleniPodpory	http://linked.opendata.cz/resource/domain/vavai/cep/prideleniPodpory/P202-12-G061
http://linked.open...iciPoslednihoRoku	2015
http://linked.open...atUdajeProjZameru	2015
http://linked.open.../vavai/cep/soutez	SGA02012GA-GB
http://linked.open...usZobrazovaneFaze	DRRVB
http://linked.open...ai/cep/typPojektu	P - Projekt výzkumu a vývoje financovaný ze státního rozpočtu
http://linked.open...ep/ukonceniReseni	2018-12-31 (xsd:date)
http://linked.open.../cep/vedlejsiObor	BA - Obecná matematika
http://linked.open...ep/zahajeniReseni	2012-01-01 (xsd:date)
http://linked.open...tniCyklusProjektu	ZBBB
is http://linked.open...vavai/riv/projekt of	Digraph width measures in parameterized algorithmics The distance-t chromatic index of graphs Minimal Obstructions for Partial Representations of Interval Graphs Peeling Potatoes Near-Optimally in Near-Linear Time Planar 4-critical graphs with four triangles The packing coloring of distance graphs D(k, t) Partition expanders ERDOS-SZEKERES-TYPE STATEMENTS: RAMSEY FUNCTION AND DECIDABILITY IN DIMENSION 1 Efficient Analysis of Probabilistic Programs with an Unbounded Counter En route to the log-rank conjecture: new reductions and equivalent formulations Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines Frames: Topology Without Points From LTL to Deterministic Automata: A Safraless Compositional Approach The fractional chromatic number of triangle-free subcubic graphs The foundation axiom and elementary self-embeddings of the universe The guarding game is E-complete Locally injective k-colourings of planar graphs LOWER BOUNDS ON GEOMETRIC RAMSEY FUNCTIONS Large networks and graph limits (review) LOWER BOUNDS ON GEOMETRIC RAMSEY FUNCTIONS Limits of near-coloring of sparse graphs Tight bounds on the maximum size of a set of permutations with bounded VC-dimension Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates A note on contracting claw-free graphs A note on Fiedler value of classes with sublinear separators A Combinatorial Classic - Sparse Graphs with High Chromatic Number A Turing Machine Distance Hierarchy Better bounds for incremental frequency allocation in bipartite graphs Contractors for Flows Computer Maintenance via Batch Execution Controllable-choice Message Sequence Graphs Compositional Approach to Suspension and Other Improvements to LTL Translation Compositional Verification and Optimization of Interactive Markov Chains The complexity of proving that a graph is Ramsey Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F,G)-Fragment Endomorphism monoids in varieties of commutative semigroups Locally constrained homomorphisms on graphs of bounded degree and bounded treewidth Lower bounds for online makespan minimization on a small number of related machines NERVES OF GOOD COVERS ARE ALGORITHMICALLY UNRECOGNIZABLE MoTraS: A Tool for Modal Transition Systems and Their Extensions Multiple Petersen subdivisions in permutation graphs Nonassociative Substructural Logics and Their Semilinear Extensions: Axiomatization and Completeness Properties Planar Emulators Conjecture Is Nearly True for Cubic Graphs Seventh workshop on the Matthews-Sumner conjecture and related problems A model theory approach to structural limits A New Analysis of Best Fit Bin Packing Abstracting Path Conditions A lower bound on the size of resolution proofs of the Ramsey theorem Biautomata for k-Piecewise Testable Languages Alternative Automata Characterization of Piecewise Testable Languages Analyzing probabilistic pushdown automata Symbiotic: Synergy of Instrumentation, Slicing, and Symbolic Execution - (Competition Contribution) Is there a best Büchi automaton for explicit model checking? Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture Total space in resolution 4-CRITICAL GRAPHS ON SURFACES WITHOUT CONTRACTIBLE ({= 4)-CYCLES A lower bound on deterministic online algorithms for scheduling on related machines without preemption Combinatorial bounds on relational complexity ClabureDB: Classified Bug-Reports Database Tool for Developers of Program Analysis Tools Compact Symbolic Execution Circumferences of 2-factors in claw-free graphs Dichotomy of the H-quasi-cover problem Determining the L(2,1)-span in polynomial space Determinacy in Stochastic Games with Unbounded Payoff Functions Distance-locally disconnected graphs Extending continuous maps: polynomiality and undecidability

Faceted Search & Find service v1.16.116 as of Feb 22 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3239 as of Feb 22 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 82 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software