Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("Hromkovic, Juraj")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 101

  • Page / 5

Export

Selection :

  • and

Graph-theoretic concepts in computer science (Smolenice, 18-20 June 1998)Hromkovic, Juraj; Sýkora, Ondrej.Lecture notes in computer science. 1998, issn 0302-9743, isbn 3-540-65195-0, X, 383 p, isbn 3-540-65195-0Conference Proceedings

Contributing to general education by teaching informaticsHROMKOVIC, Juraj.Lecture notes in computer science. 2006, pp 25-37, issn 0302-9743, isbn 3-540-48218-0, 1Vol, 13 p.Conference Paper

Randomized communication protocols (a survey)HROMKOVIC, Juraj.Lecture notes in computer science. 2001, pp 1-32, issn 0302-9743, isbn 3-540-43025-3Conference Paper

Nondeterministic communication with a limited number of advice bitsHROMKOVIC, Juraj; SCHNITGER, Georg.SIAM journal on computing (Print). 2004, Vol 33, Num 1, pp 43-68, issn 0097-5397, 26 p.Article

On the power of Las Vegas II: Two-way finite automataHROMKOVIC, Juraj; SCHNITGER, Georg.Theoretical computer science. 2001, Vol 262, Num 1-2, pp 1-24, issn 0304-3975Article

On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automataHROMKOVIC, Juraj; SCHNITGER, Georg.Information and computation (Print). 2001, Vol 169, Num 2, pp 284-296, issn 0890-5401Article

On probabilistic pushdown automataHROMKOVIC, Juraj; SCHNITGER, Georg.Information and computation (Print). 2010, Vol 208, Num 8, pp 982-995, issn 0890-5401, 14 p.Article

International Workshop on Graph-Theoretic Concepts in Computer Science, WG'98, Selected PapersHROMKOVIC, Juraj; SYKORA, Ondrej.Discrete applied mathematics. 2001, Vol 108, Num 1-2, issn 0166-218X, 213 p.Serial Issue

WG 2004 : graph-theoretic concepts in computer science (Bad Honnef, 21-23 June 2004, revised papers)Hromkovic, Juraj; Nagl, Manfred; Westfechtel, Bernhard et al.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-24132-9, XI, 404 p, isbn 3-540-24132-9Conference Proceedings

Coloring a graph using split decompositionRAO, Michaël.Lecture notes in computer science. 2004, pp 129-141, issn 0302-9743, isbn 3-540-24132-9, 13 p.Conference Paper

Internally typed second-order term graphsKAHL, W.Lecture notes in computer science. 1998, pp 149-163, issn 0302-9743, isbn 3-540-65195-0Conference Paper

Minus domination in small-degree graphsDAMASCHKE, P.Lecture notes in computer science. 1998, pp 17-25, issn 0302-9743, isbn 3-540-65195-0Conference Paper

An estimate of the tree-width of a planar graph which has not a given planar grid as a minorGORBUNOV, K. Yu.Lecture notes in computer science. 1998, pp 372-383, issn 0302-9743, isbn 3-540-65195-0Conference Paper

Wireless networking: Graph theory unpluggedWATTENHOFER, Roger.Lecture notes in computer science. 2004, pp 20-32, issn 0302-9743, isbn 3-540-24132-9, 13 p.Conference Paper

Broadcasting on anonymous unoriented ToriDOBREV, S; RUZICKA, P.Lecture notes in computer science. 1998, pp 50-62, issn 0302-9743, isbn 3-540-65195-0Conference Paper

Domination and steiner tree problems on graphs with few P4sBABEL, L; OLARIU, S.Lecture notes in computer science. 1998, pp 337-350, issn 0302-9743, isbn 3-540-65195-0Conference Paper

A symbolic approach to the all-pairs shortest-paths problemSAWITZKI, Daniel.Lecture notes in computer science. 2004, pp 154-167, issn 0302-9743, isbn 3-540-24132-9, 14 p.Conference Paper

Linear algorithms for a k-partition problem of planar graphs without specifying basesWADA, K; WEI CHEN.Lecture notes in computer science. 1998, pp 324-336, issn 0302-9743, isbn 3-540-65195-0Conference Paper

Rankings of directed graphsKRATOCHVIL, J; TUZA, Z.Lecture notes in computer science. 1998, pp 114-123, issn 0302-9743, isbn 3-540-65195-0Conference Paper

Minimum fill-in and treewidth for graphs modularly decomposable into chordal graphsDAHLHAUS, E.Lecture notes in computer science. 1998, pp 351-358, issn 0302-9743, isbn 3-540-65195-0Conference Paper

Triangles in Euclidean arrangementsFELSNER, S; KRIEGEL, K.Lecture notes in computer science. 1998, pp 137-148, issn 0302-9743, isbn 3-540-65195-0Conference Paper

A graph-theoretic generalization of the least common subsumer and the most specific concept in the description logic εLBAADER, Franz.Lecture notes in computer science. 2004, pp 177-188, issn 0302-9743, isbn 3-540-24132-9, 12 p.Conference Paper

Communication in the two-way listen-in vertex-disjoint paths modeBÖCKENHAUER, H.-J.Lecture notes in computer science. 1998, pp 38-49, issn 0302-9743, isbn 3-540-65195-0Conference Paper

Improved compressions of cube-connected cycles networksKLASING, R.Lecture notes in computer science. 1998, pp 242-256, issn 0302-9743, isbn 3-540-65195-0Conference Paper

Families of Graphs having broadcasting and gossiping propertiesFERTIN, G; RASPAUD, A.Lecture notes in computer science. 1998, pp 63-77, issn 0302-9743, isbn 3-540-65195-0Conference Paper

  • Page / 5