Result 1 to 20 of 101 total
Visibly pushdown automata with multiplicities: finiteness and $K$-boundedness. (English)
Yen, Hsu-Chun (ed.) et al., Developments in language theory. 16th international conference, DLT 2012, Taipei, Taiwan, August 14-17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31652-4/pbk). Lecture Notes in Computer Science 7410, 226-238 (2012).
1
Vertex Ramsey problems in the hypercube. (English)
SIAM J. Discrete Math. 26, No. 2, 838-853 (2012).
2
New Turán densities for 3-graphs. (English)
Electron. J. Comb. 19, No. 2, Research Paper P22, 21 p., electronic only (2012).
3
An accurate type system for information flow in presence of arrays. (English)
Bruni, Roberto (ed.) et al., Formal techniques for distributed systems. Joint 13th IFIP WG 6.1 international conference, FMOODS 2011, and 31st IFIP WG 6.1 international conference, FORTE 2011, Reykjavik, Iceland, June 6‒9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21460-8/pbk). Lecture Notes in Computer Science 6722, 153-167 (2011).
4
Special issue: Selected papers based on the presentations at the 22nd British combinatorial conference, St. Andrews, UK, July 6‒10, 2009. (English)
Discrete Math. 311, No. 13, 1073-1254 (2011).
5
Hypergraphs do jump. (English)
Comb. Probab. Comput. 20, No. 2, 161-171 (2011).
6
Hypergraphs do jump (English)
Combinatorics, Probability & Computing 20, No. 2, 161-171 (2011).
7
An accurate type system for information flow in presence of arrays (English)
FMOODS/FORTE, 153-167 (2011).
8
The minimal density of triangles in tripartite graphs. (English)
LMS J. Comput. Math. 13, 388-413, electronic only (2010).
9
Tree automata with global constraints. (English)
Int. J. Found. Comput. Sci. 21, No. 4, 571-596 (2010).
10
Properties of visibly pushdown transducers. (English)
Hliněný, Petr (ed.) et al., Mathematical foundations of computer science 2010. 35th international symposium, MFCS 2010, Brno, Czech Republic, August 23‒27, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15154-5/pbk). Lecture Notes in Computer Science 6281, 355-367 (2010).
11
On the density of 2-colorable 3-graphs in which any four points span at most two edges. (English)
J. Comb. Des. 18, No. 2, 105-114 (2010).
12
On functionality of visibly pushdown transducers. (English)
Comput. Res. Repos. 2010, Article No. 1002.1443 (2010).
13
Vertex Turán problems in the hypercube. (English)
J. Comb. Theory, Ser. A 117, No. 4, 454-465 (2010).
14
A sound analysis for secure information flow using abstract memory graphs. (English)
Arbab, Farhad (ed.) et al., Fundamentals of software engineering. Third IPM international conference, FSEN 2009, Kish Island, Iran, April 15‒17, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-11622-3/pbk). Lecture Notes in Computer Science 5961, 355-370 (2010).
15
Vertex turán problems in the hypercube (English)
J. Comb. Theory, Ser. A 117, No. 4, 454-465 (2010).
16
An extension of wilkinson’s algorithm for positioning tick labels on axes (English)
IEEE Trans. Vis. Comput. Graph. 16, No. 6, 1036-1043 (2010).
17
Adapting daniel and wood’s modeling approach to interactive visual analytics (English)
IEEE VAST, 253-254 (2010).
18
Properties of visibly pushdown transducers (English)
MFCS, 355-367 (2010).
19
Online aggregation and continuous query support in mapreduce (English)
SIGMOD Conference, 1115-1118 (2010).
20
Result 1 to 20 of 101 total
Start
Contact
Print
General Help
