vcvpaiva's watchlist [more than 800 articles] Export

Recent papers matching vcvpaiva's watchlist criteria

	Listing closed sets of strongly accessible set systems with applications to data mining☆ [My Copy] Theoretical Computer Science (16 November 2009) by Mario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel
	NP-completeness of stst-orientations for plane graphs☆ [My Copy] Theoretical Computer Science (16 November 2009) by Sadish Sadasivam, Huaming Zhang
	Partially dynamic efficient algorithms for distributed shortest paths☆ [My Copy] Theoretical Computer Science (16 November 2009) by Serafino Cicerone, Gianlorenzo D’Angelo, Gabriele Di Stefano, Daniele Frigioni
	The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers☆ [My Copy] Theoretical Computer Science (13 November 2009) by Yukun Cheng, Liying Kang, Changhong Lu
	Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data☆ [My Copy] Theoretical Computer Science (13 November 2009) by Matthew de Brecht, Akihiro Yamamoto
	Energy optimal schedules for jobs with multiple active intervals [My Copy] Theoretical Computer Science (13 November 2009) by Wanyong Tian, Minming Li, Enhong Chen
	A polynomial solution to the kk-fixed-endpoint path cover problem on proper interval graphs [My Copy] Theoretical Computer Science (13 November 2009) by Katerina Asdre, Stavros D. Nikolopoulos
	Semigroup automata with rational initial and terminal sets [My Copy] Theoretical Computer Science (13 November 2009) by Elaine Render, Mark Kambites
	Spiking neural P systems: An improved normal form [My Copy] Theoretical Computer Science (13 November 2009) by Linqiang Pan, Gheorghe Păun
	All-to-all personalized exchange in generalized shuffle-exchange networks☆ [My Copy] Theoretical Computer Science (10 November 2009) by Well Y. Chou, Chiuyuan Chen
	Invariants for Parameterised Boolean Equation Systems [My Copy] Theoretical Computer Science (10 November 2009) by Simona Orzan, Tim A. C. Willemse
	Preface to the special issue icalp 2005 track C [My Copy] Theoretical Computer Science (06 November 2009) by Moti Yung
	Basing cryptographic protocols on tamper-evident seals [My Copy] Theoretical Computer Science (31 October 2009) by Tal Moran, Moni Naor
	Symbolic protocol analysis in the union of disjoint intruder theories: Combining decision procedures☆ [My Copy] Theoretical Computer Science (31 October 2009) by Yannick Chevalier, Michael Rusinowitch
	Bounds on the efficiency of black-box commitment schemes [My Copy] Theoretical Computer Science (30 October 2009) by Omer Horvitz, Jonathan Katz
	Simple extractors via constructions of cryptographic pseudo-random generators [My Copy] Theoretical Computer Science (28 October 2009) by Marius Zimand
	Factorization forests for infinite words and applications to countable scattered linear orderings [My Copy] Theoretical Computer Science (25 October 2009) by Thomas Colcombet
	Preface [My Copy] Theoretical Computer Science (24 October 2009) by Erzsébet Csuhaj-Varjú, Zoltán Ésik
	On blockwise symmetric signatures for matchgates☆ [My Copy] Theoretical Computer Science (24 October 2009) by Jin-Yi Cai, Pinyan Lu
	On the complexity of kings [My Copy] Theoretical Computer Science (24 October 2009) by Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe
	Real-time reversible iterative arrays [My Copy] Theoretical Computer Science (24 October 2009) by Martin Kutrib, Andreas Malcher
	On notions of regularity for data languages☆ [My Copy] Theoretical Computer Science (24 October 2009) by Henrik Björklund, Thomas Schwentick
	Complexity issues in color-preserving graph embeddings [My Copy] Theoretical Computer Science (24 October 2009) by Gaëlle Brevier, Romeo Rizzi, Stéphane Vialette
	Extended strings and graphs for simple gene assembly [My Copy] Theoretical Computer Science (24 October 2009) by Robert Brijder, Miika Langille, Ion Petre
	Productivity of stream definitions☆ [My Copy] Theoretical Computer Science (24 October 2009) by Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan W. Klop
	Notions of hyperbolicity in monoids [My Copy] Theoretical Computer Science (24 October 2009) by Michael Hoffmann, Richard M. Thomas
	Some complexity results for prefix Gröbner bases in free monoid rings [My Copy] Theoretical Computer Science (24 October 2009) by Andrea Sattler-Klein
	Model-checking Web Services Orchestrations using BP-calculus [My Copy] Electronic Notes in Theoretical Computer Science, Vol. 255 (10 November 2009), pp. 3-21. by Faisal Abouzaid, John Mullins
	Formalizing Adaptation On-the-Fly [My Copy] Electronic Notes in Theoretical Computer Science, Vol. 255 (10 November 2009), pp. 23-44. by S. Andova, L. P. J. Groenewegen, J. Stafleu, E. P. de Vink
	Implementation of an Orchestration Language as a Haskell Domain Specific Language [My Copy] Electronic Notes in Theoretical Computer Science, Vol. 255 (10 November 2009), pp. 45-64. by Marco D. Campos, L. S. Barbosa
	Checking Protocol Compatibility using Maude [My Copy] Electronic Notes in Theoretical Computer Science, Vol. 255 (10 November 2009), pp. 65-81. by Francisco Durán, Meriem Ouederni, Gwen Salaün
	Functional Active Objects: Typing and Formalisation [My Copy] Electronic Notes in Theoretical Computer Science, Vol. 255 (10 November 2009), pp. 83-101. by Ludovic Henrio, Florian Kammüller
	SAT-based Verification for Timed Component Connectors [My Copy] Electronic Notes in Theoretical Computer Science, Vol. 255 (10 November 2009), pp. 103-118. by Stephanie Kemper
	Connectors as Designs [My Copy] Electronic Notes in Theoretical Computer Science, Vol. 255 (10 November 2009), pp. 119-135. by Sun Meng, Farhad Arbab
	Automated Analysis of Reo Circuits using Symbolic Execution [My Copy] Electronic Notes in Theoretical Computer Science, Vol. 255 (10 November 2009), pp. 137-158. by Bahman Pourvatan, Marjan Sirjani, Hossein Hojjat, Farhad Arbab
	Analyzing Chor Specifications by Translation into FSP [My Copy] Electronic Notes in Theoretical Computer Science, Vol. 255 (10 November 2009), pp. 159-176. by Nima Roohi, Gwen Salaün, Seyyed H. Mirian
	Conformant plans and beyond: Principles and complexity [My Copy] Artificial Intelligence (03 November 2009) by Blai Bonet
	Preface [My Copy] Electronic Notes in Theoretical Computer Science, Vol. 253, No. 4. (06 November 2009), pp. 1-2. by Andrea Corradini
	A Note on an Old-Fashioned Algebra for (Disconnected) Graphs [My Copy] Electronic Notes in Theoretical Computer Science, Vol. 253, No. 4. (06 November 2009), pp. 3-15. by Fabio Gadducci
	A Port Graph Calculus for Autonomic Computing and Invariant Verification [My Copy] Electronic Notes in Theoretical Computer Science, Vol. 253, No. 4. (06 November 2009), pp. 17-38. by Oana Andrei, Hélène Kirchner
	A Term Rewriting Technique for Decision Graphs [My Copy] Electronic Notes in Theoretical Computer Science, Vol. 253, No. 4. (06 November 2009), pp. 39-54. by Bahareh Badban
	Recursive Functions with Pattern Matching in Interaction Nets [My Copy] Electronic Notes in Theoretical Computer Science, Vol. 253, No. 4. (06 November 2009), pp. 55-71. by Maribel Fernández, Ian Mackie, Shinya Sato, Matthew Walker
	Compilation of Interaction Nets [My Copy] Electronic Notes in Theoretical Computer Science, Vol. 253, No. 4. (06 November 2009), pp. 73-90. by Abubakar Hassan, Ian Mackie, Shinya Sato
	Strong Joinability Analysis for Graph Transformation Systems in CHR [My Copy] Electronic Notes in Theoretical Computer Science, Vol. 253, No. 4. (06 November 2009), pp. 91-111. by Frank Raiser, Thom Frühwirth
	Lazy Constraint Imposing for Improving the Path Constraint [My Copy] Electronic Notes in Theoretical Computer Science, Vol. 253, No. 4. (06 November 2009), pp. 113-128. by Ruben D. Viegas, Francisco Azevedo
	The effective theory of Borel equivalence relations☆ [My Copy] Annals of Pure and Applied Logic (27 October 2009) by Ekaterina B. Fokina, Sy-David Friedman, Asger Törnquist
	Beyond Borel-amenability: Scales and superamenable reducibilities [My Copy] Annals of Pure and Applied Logic (16 October 2009) by L. Motto Ros
	Bounded treewidth as a key to tractability of knowledge representation and reasoning☆ [My Copy] Artificial Intelligence (20 October 2009) by Georg Gottlob, Reinhard Pichler, Fang Wei posted by 1 person fheintz
	Comparing notions of randomness [My Copy] Theoretical Computer Science (17 October 2009) by Bart Kastermans, Steffen Lempp
	Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network [My Copy] Theoretical Computer Science (16 October 2009) by Mauro Mezzini, Marina Moscarini

Note: You may cite this page as: http://www.citeulike.org/user/vcvpaiva/watchlist

Result page: 1 2 3 4 5 6 7 8 9 10 Next

logic	43
linear	31
categorical	17
semantics	7
explicit-subs	6
modal	6
own	6
full-intuitionistic	3
knowledge	3
algebraic	2
intuitionistic	2
proofnets	2
cat	1
combination	1
combinators	1
functor	1
kripke	1
language	1
lexical	1
lextensiva	1
logical	1
nets	1
petri	1
predicates	1
review	1
sequent-calculus	1

vcvpaiva's watchlist [more than 800 articles] Export

vcvpaiva's tags