Procházení Publikační činnost Katedry informatiky / Publications of Department of Computer Science (460) dle data vydání
Zobrazují se záznamy 1-20 z 562
-
Equivalence checking of non-flat systems is EXPTIME-hard
(CONCUR 2003 - Concurrency Theory : 14th International Conference, Marseille, France, September 3-5, 2003. Proceedings. 2003, p. 237-250.) -
Advanced error-control coding methods enhance reliability of transmission and storage data systems
(Radioengineering. 2003, vol. 12, no. 1, p. 39-44.) -
Deciding bisimilarity between BPA and BPP processes
(CONCUR 2003 - Concurrency Theory : 14th International Conference, Marseille, France, September 3-5, 2003. Proceedings. 2003, p. 159-173.) -
On matroid properties definable in the MSO logic
(Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003. Proceedings. 2003, p. 470-479.) -
Revisiting M-tree building principles
(Advances in databases and information systems. 2003, p. 148-162.) -
Space decomposition preconditioners and their application in geomechanics
(Mathematics and Computers in Simulation. 2003, vol. 61, issues 3-6, p. 409-420.) -
Knowledge sharing in organizational structures
(Kybernetika. 2004, vol. 40, no. 3, p. 305-316.) -
On decidability of MSO theories of representable matroids
(Parameterized and exact computation : First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004. Proceedings. 2006, p. 96-107.) -
Space decomposition solvers and their performance in PC-based parallel computing environments
(Parallel processing and applied mathematics : 5th International Conference, PPAM 2003, Czestochowa, Poland, September 7-10, 2003. Revised papers. 2004, p. 153-160.) -
Strategy extraction for mobile embedded control systems apply the multi-agent technology
(Computational Science - ICCS 2004 : 4th International Conference, Kraków, Poland, June 6-9, 2004, Proceedings, Part III. 2004, p. 631-637.) -
Multidimensional term indexing for efficient processing of complex queries
(Kybernetika. 2004, vol. 40, no. 3, p. 381-396.) -
Metric indexing for the vector model in Text Retrieval
(String processing and information retrieval : 11th International Conference, SPIRE 2004, Padova, Italy, October 5-8, 2004. Proceedings. 2004, p. 183-195.) -
Crossing number is hard for cubic graphs
(Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004. Proceedings. 2004, p. 772-782.) -
Implementation of XPath axes in the multi-dimensional approach to indexing XML data
(Current Trends in Database Technology - EDBT 2004 Workshops : EDBT 2004 Workshops PhD, DataX, PIM, P2P&DB, and ClustWeb, Heraklion, Crete, Greece, March 14-18, 2004. Revised selected papers. 2004, p.219-229.) -
DP lower bounds for equivalence-checking and model-checking of one-counter automata
(Information and Computation. 2004, vol. 188, issue 1, p. 1-19.) -
On possible counterexamples to Negami's planar cover conjecture
(Journal of Graph Theory. 2004, vol. 46, issue 3, p. 183-206.) -
Behavioural equivalences on finite-state systems are PTIME-hard
(Computing and Informatics. 2005, vol. 24, no. 5, p. 513-528.) -
Efficient searching in large inheritance hierarchies
(Database and Expert Systems Applications : 16th International Conference, DEXA 2005, Copenhagen, Denmark, August 22-26, 2005. Proceedings. 2005, p. 940-952.) -
Modified LSI model for efficient search by metric access methods
(Advances in information retrieval : 27th European Conference on IR Research, ECIR 2005, Santiago de Compostela, Spain, March 21-23, 2005. Proceedings. 2005, p. 245-259.) -
Nearest neighbours search using the PM-Tree
(Database Systems for Advanced Applications : 10th International Conference, DASFAA 2005, Beijing, China, April 17-20, 2005. Proceedings. 2005, p. 803-815.)