Search results for "CSR"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
35	Chris Calabro, Ramamohan Paturi	k-SAT Is No Harder Than Decision-Unique-k-SAT.	CSR	2009	DBLP DOI BibTeX RDF	unique satisfiability, independent set, quantified Boolean formulas, hitting set, k-SAT, exponential complexity
35	Mark A. Hillebrand, Sergey Tverdyshev	Formal Verification of Gate-Level Computer Systems.	CSR	2009	DBLP DOI BibTeX RDF
35	Abuzer Yakaryilmaz, A. C. Cem Say	Languages Recognized with Unbounded Error by Quantum Finite Automata.	CSR	2009	DBLP DOI BibTeX RDF
35	Neeldhara Misra, Venkatesh Raman 0001, Saket Saurabh 0001, Somnath Sikdar	The Budgeted Unique Coverage Problem and Color-Coding.	CSR	2009	DBLP DOI BibTeX RDF
35	Maurice J. Jansen	Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials.	CSR	2009	DBLP DOI BibTeX RDF	elementary symmetric polynomial, Computational complexity, determinant, arithmetical circuits, permanent
35	Pedro Cabalar, Sergei P. Odintsov, David Pearce 0001	Well-Founded and Partial Stable Semantics Logical Aspects.	CSR	2009	DBLP DOI BibTeX RDF	partial stable models, equilibrium logic, partial equilibrium logic, well-founded semantics
35	Dogan Kesdogan, Daniel Mölle, Stefan Richter 0001, Peter Rossmanith	Breaking Anonymity by Learning a Unique Minimum Hitting Set.	CSR	2009	DBLP DOI BibTeX RDF
35	Yi Deng 0002, Giovanni Di Crescenzo, Dongdai Lin, Dengguo Feng	Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model.	CSR	2009	DBLP DOI BibTeX RDF
35	B. V. Raghavendra Rao, Jayalal Sarma	On the Complexity of Matroid Isomorphism Problems.	CSR	2009	DBLP DOI BibTeX RDF
35	Dmitry Itsykson	Structural Complexity of AvgBPP.	CSR	2009	DBLP DOI BibTeX RDF
35	Ely Porat	An Optimal Bloom Filter Replacement Based on Matrix Solving.	CSR	2009	DBLP DOI BibTeX RDF
35	Peter Jonsson, Johan Thapper	Approximability of the Maximum Solution Problem for Certain Families of Algebras.	CSR	2009	DBLP DOI BibTeX RDF	computational complexity, approximability, Optimisation, constraint satisfaction, algebra
35	Niko Haubold, Markus Lohrey	Compressed Word Problems in HNN-Extensions and Amalgamated Products.	CSR	2009	DBLP DOI BibTeX RDF
35	Christian Choffrut, Juhani Karhumäki	Unique Decipherability in the Monoid of Languages: An Application of Rational Relations.	CSR	2009	DBLP DOI BibTeX RDF	Unique decipherability, finite automata, regular languages
35	Edward A. Hirsch, Sergey I. Nikolenko	A Feebly Secure Trapdoor Function.	CSR	2009	DBLP DOI BibTeX RDF
35	Artur Jez, Alexander Okhotin	One-Nonterminal Conjunctive Grammars over a Unary Alphabet.	CSR	2009	DBLP DOI BibTeX RDF
35	Maurice J. Jansen, B. V. Raghavendra Rao	Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity.	CSR	2009	DBLP DOI BibTeX RDF
35	Galina Jirásková	Concatenation of Regular Languages and Descriptional Complexity.	CSR	2009	DBLP DOI BibTeX RDF
35	Tommy Färnqvist, Peter Jonsson, Johan Thapper	Approximability Distance in the Space of H-Colourability Problems.	CSR	2009	DBLP DOI BibTeX RDF	graph H-colouring, computational complexity, approximability, optimisation, graph homomorphism
35	Daniil Musatov, Andrei E. Romashchenko, Alexander Shen	Variations on Muchnik's Conditional Complexity Theorem.	CSR	2009	DBLP DOI BibTeX RDF
35	Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger	Partitioning Graphs into Connected Parts.	CSR	2009	DBLP DOI BibTeX RDF
35	Hongseok Yang	Automatic Verification of Heap-Manipulating Programs Using Separation Logic.	CSR	2009	DBLP DOI BibTeX RDF
35	Nikolay K. Vereshchagin	Kolmogorov Complexity and Model Selection.	CSR	2009	DBLP DOI BibTeX RDF
35	Mikhail N. Vyalyi	On Models of a Nondeterministic Computation.	CSR	2009	DBLP DOI BibTeX RDF	language, nondeterminism, automaton, complexity class
35	Andreas Goerdt	On Random Ordering Constraints.	CSR	2009	DBLP DOI BibTeX RDF	random structures, Algorithms, logic, probabilistic analysis, ordering
35	Edward A. Hirsch, Alexander A. Razborov, Alexei L. Semenov, Anatol Slissenko (eds.)	Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings	CSR	2008	DBLP DOI BibTeX RDF
35	Zurab Khasidashvili	On Formal Equivalence Verification of Hardware.	CSR	2008	DBLP DOI BibTeX RDF
35	Sergei N. Artëmov, Elena Nogina	Topological Semantics of Justification Logic.	CSR	2008	DBLP DOI BibTeX RDF	Justification Logic, Logic of Proofs, topological semantics, Tarski, modal logic
35	Limsoon Wong	Manifestation and Exploitation of Invariants in Bioinformatics.	CSR	2008	DBLP DOI BibTeX RDF
35	Denis Osin, Vladimir Shpilrain	Public Key Encryption and Encryption Emulation Attacks.	CSR	2008	DBLP DOI BibTeX RDF
35	Vikraman Arvind, Bireswar Das, Johannes Köbler	A Logspace Algorithm for Partial 2-Tree Canonization.	CSR	2008	DBLP DOI BibTeX RDF
35	Maxime Rebout, Louis Féraud, Sergei Soloviev 0001	A Unified Categorical Approach for Attributed Graph Rewriting.	CSR	2008	DBLP DOI BibTeX RDF
35	Uri Zwick	Simple Stochastic Games, Mean Payoff Games, Parity Games.	CSR	2008	DBLP DOI BibTeX RDF
35	Dusko Pavlovic	Network as a Computer: Ranking Paths to Find Flows.	CSR	2008	DBLP DOI BibTeX RDF
35	Jirí Fiala 0001, Daniël Paulusma	Comparing Universal Covers in Polynomial Time.	CSR	2008	DBLP DOI BibTeX RDF
35	Rostislav Deviatov	On Subword Complexity of Morphic Sequences.	CSR	2008	DBLP DOI BibTeX RDF
35	Eric Allender	Cracks in the Defenses: Scouting Out Approaches on Circuit Lower Bounds.	CSR	2008	DBLP DOI BibTeX RDF
35	Ugo Dal Lago, Martin Hofmann 0001	A Semantic Proof of Polytime Soundness of Light Affine Logic.	CSR	2008	DBLP DOI BibTeX RDF
35	Vladimir V. V'yugin	On Sequences with Non-learnable Subsequences.	CSR	2008	DBLP DOI BibTeX RDF
35	Arseny M. Shur	Combinatorial Complexity of Regular Languages.	CSR	2008	DBLP DOI BibTeX RDF
35	Uffe Flarup, Laurent Lyaudet	On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract).	CSR	2008	DBLP DOI BibTeX RDF
35	Victor Y. Pan, Dmitriy Ivolgin, Brian Murphy, Rhys Eric Rosholt, Yuqing Tang 0001, Xiaodong Yan	Additive Preconditioning for Matrix Computations.	CSR	2008	DBLP DOI BibTeX RDF	Additive preconditioning, Weak randomization, Matrix computations
35	Yury Savateev	Lambek Grammars with One Division Are Decidable in Polynomial Time.	CSR	2008	DBLP DOI BibTeX RDF
35	Markus Bläser, Holger Dell, Johann A. Makowsky	Complexity of the Bollobás-Riordan Polynomial.	CSR	2008	DBLP DOI BibTeX RDF
35	Vladimir V. Podolskii	A Uniform Lower Bound on Weights of Perceptrons.	CSR	2008	DBLP DOI BibTeX RDF
35	Laura Kovács	Invariant Generation for P-Solvable Loops with Assignments.	CSR	2008	DBLP DOI BibTeX RDF
35	Mingyu Xiao 0001	Algorithms for Multiterminal Cuts.	CSR	2008	DBLP DOI BibTeX RDF	Multiterminal Cut, Graph Algorithm, Fixed Parameter Tractability, Multicut
35	Valery A. Nepomniaschy, Dmitri M. Beloglazov, Tatiana G. Churina, Mikhail Mashukov	Using Coloured Petri Nets to Model and Verify Telecommunications Systems.	CSR	2008	DBLP DOI BibTeX RDF
35	Enrico Formenti, Jarkko Kari, Siamak Taati	The Most General Conservation Law for a Cellular Automaton.	CSR	2008	DBLP DOI BibTeX RDF
35	Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Vladimir Oudalov	A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames.	CSR	2008	DBLP DOI BibTeX RDF
35	Melvin Fitting	S4LPand Local Realizability.	CSR	2008	DBLP DOI BibTeX RDF
35	Maxim A. Babenko, Tatiana Starikovskaya	Computing Longest Common Substrings Via Suffix Arrays.	CSR	2008	DBLP DOI BibTeX RDF
35	Arnon Avron, Anna Zamansky	A Triple Correspondence in Canonical Calculi: Strong Cut-Elimination, Coherence, and Non-deterministic Semantics.	CSR	2008	DBLP DOI BibTeX RDF
35	Vladimir Shpilrain	Cryptanalysis of Stickel's Key Exchange Scheme.	CSR	2008	DBLP DOI BibTeX RDF
35	Dmitriy Yu. Cherukhin	Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates.	CSR	2008	DBLP DOI BibTeX RDF	complexity, lower bound, Boolean function, circuit, depth, cyclic convolution
35	Avi Wigderson	Randomness - A Computational Complexity Perspective.	CSR	2008	DBLP DOI BibTeX RDF	derandomnization, complexity, randomness, pseudorandom
35	Nicolas Bedon, Alexis Bès, Olivier Carton, Chloe Rispal	Logic and Rational Languages of Words Indexed by Linear Orderings.	CSR	2008	DBLP DOI BibTeX RDF
35	Nutan Limaye, Meena Mahajan, Antoine Meyer	On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata.	CSR	2008	DBLP DOI BibTeX RDF
35	Yevgeniy V. Bodyanskiy, Sergiy Popov, Taras Rybalchenko	Multilayer Neuro-fuzzy Network for Short Term Electric Load Forecasting.	CSR	2008	DBLP DOI BibTeX RDF
35	Roman Kuznets	Self-referentiality of Justified Knowledge.	CSR	2008	DBLP DOI BibTeX RDF
35	Pavel Pudlák	Twelve Problems in Proof Complexity.	CSR	2008	DBLP DOI BibTeX RDF
35	Sumit Ganguly	Lower Bounds on Frequency Estimation of Data Streams (Extended Abstract).	CSR	2008	DBLP DOI BibTeX RDF
35	Didier Caucal, Stéphane Hassen	Synchronization of Grammars.	CSR	2008	DBLP DOI BibTeX RDF
35	Marius Zimand	Two Sources Are Better Than One for Increasing the Kolmogorov Complexity of Infinite Sequences.	CSR	2008	DBLP DOI BibTeX RDF	Hausdorff dimension, Kolmogorov complexity
35	Johannes Köbler, Oleg Verbitsky 0001	From Invariants to Canonization in Parallel.	CSR	2008	DBLP DOI BibTeX RDF
35	Volker Diekert, Mikhail V. Volkov 0001, Andrei Voronkov (eds.)	Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings	CSR	2007	DBLP DOI BibTeX RDF
35	Reza Moraveji, Hamid Sarbazi-Azad, Abbas Nayebi, Keivan Navi	Performance Modeling of Wormhole Hypermeshes Under Hotspot Traffic.	CSR	2007	DBLP DOI BibTeX RDF	Hypermesh, Hotspot traffic, Interconnection network, Performance modeling
35	Sergey P. Tarasov, Mikhail N. Vyalyi	An Efficient Algorithm for Zero-Testing of a Lacunary Polynomial at the Roots of Unity.	CSR	2007	DBLP DOI BibTeX RDF	algorithm, sparse representation, root of unity, cyclotomic polynomial
35	Artur Jez, Alexander Okhotin	Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth.	CSR	2007	DBLP DOI BibTeX RDF
35	Bogdan Aman, Gabriel Ciobanu	Timers and Proximities for Mobile Ambients.	CSR	2007	DBLP DOI BibTeX RDF
35	Harry Buhrman, Lance Fortnow, Michal Koucký 0001, John D. Rogers, Nikolai K. Vereshchagin	Inverting Onto Functions and Polynomial Hierarchy.	CSR	2007	DBLP DOI BibTeX RDF
35	Andrey Yu. Rumyantsev	Kolmogorov Complexity, Lovász Local Lemma and Critical Exponents.	CSR	2007	DBLP DOI BibTeX RDF
35	Markus Lohrey, Saul Schleimer	Efficient Computation in Groups Via Compression.	CSR	2007	DBLP DOI BibTeX RDF
35	Alexei G. Myasnikov	Generic Complexity of Undecidable Problems.	CSR	2007	DBLP DOI BibTeX RDF
35	Yury Lifshits, Dirk Nowotka	Estimation of the Click Volume by Large Scale Regression Analysis.	CSR	2007	DBLP DOI BibTeX RDF
35	Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka	Maximal Intersection Queries in Randomized Graph Models.	CSR	2007	DBLP DOI BibTeX RDF
35	Meena Mahajan, Jayalal Sarma	On the Complexity of Matrix Rank and Rigidity.	CSR	2007	DBLP DOI BibTeX RDF
35	Sylvain Perifel	Symmetry of Information and Nonuniform Lower Bounds.	CSR	2007	DBLP DOI BibTeX RDF	nonuniform lower bounds, resource-bounded Kolmogorov complexity, symmetry of information, computational complexity
35	Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr	Equivalence Problems for Circuits over Sets of Natural Numbers.	CSR	2007	DBLP DOI BibTeX RDF
35	Alexei Lysenko	Constructing a Secret Binary Partition of a Digital Image Robust to a Loss of Synchronization.	CSR	2007	DBLP DOI BibTeX RDF	secret image partition, pseudorandom partition, loss of synchronization problem, digital image watermarking
35	Robin Sharp, Michael R. Hansen	Timed Traces and Strand Spaces.	CSR	2007	DBLP DOI BibTeX RDF	verification, real-time, Security protocols, interval logic
35	Mark Sh. Levin	Towards Hierarchical Clustering (Extended Abstract).	CSR	2007	DBLP DOI BibTeX RDF	agglomerative algorithm, hierarchy, system architecture, Hierarchical clustering, multicriteria analysis
35	Ziyad Hanna	Abstract Modeling and Formal Verification of Microprocessors.	CSR	2007	DBLP DOI BibTeX RDF
35	Scott Aaronson	The Limits of Quantum Computers.	CSR	2007	DBLP DOI BibTeX RDF
35	Alexander N. Rybalov	Generic Complexity of Presburger Arithmetic.	CSR	2007	DBLP DOI BibTeX RDF
35	Dominique Cansell, Dominique Méry	Proved-Patterns-Based Development for Structured Programs.	CSR	2007	DBLP DOI BibTeX RDF
35	Alexei Lisitsa 0001, Andrei P. Nemytykh	A Note on Specialization of Interpreters.	CSR	2007	DBLP DOI BibTeX RDF	program verification, cache coherence protocols, Program specialization, supercompilation
35	Maxim A. Babenko	A Fast Algorithm for Path 2-Packing Problem.	CSR	2007	DBLP DOI BibTeX RDF
35	Kalle Saari	Everywhere alpha -Repetitive Sequences and Sturmian Words.	CSR	2007	DBLP DOI BibTeX RDF	Everywhere ?-repetitive sequence, ?-power, squareful sequence, overlapful sequence, Sturmian word
35	Rajeev Alur	Marrying Words and Trees.	CSR	2007	DBLP DOI BibTeX RDF
35	Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan	Planarity, Determinants, Permanents, and (Unique) Matchings.	CSR	2007	DBLP DOI BibTeX RDF
35	Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen	Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems.	CSR	2007	DBLP DOI BibTeX RDF	maximum constraint satisfaction, complexity, approximability
35	Vladimir V. Podolskii	Perceptrons of Large Weight.	CSR	2007	DBLP DOI BibTeX RDF
35	Victor S. Grishchenko	Bouillon: A Wiki-Wiki Social Web.	CSR	2007	DBLP DOI BibTeX RDF
35	Holger Bock Axelsen, Robert Glück, Tetsuo Yokoyama	Reversible Machine Code and Its Abstract Processor Architecture.	CSR	2007	DBLP DOI BibTeX RDF
35	Jorge R. Manjarrez Sanchez, José Martinez 0001, Patrick Valduriez	On the Usage of Clustering for Content Based Image Retrieval.	CSR	2007	DBLP DOI BibTeX RDF
35	Victor Poupet	A Padding Technique on Cellular Automata to Transfer Inclusions of Complexity Classes.	CSR	2007	DBLP DOI BibTeX RDF
35	Bernhard Heinemann	A PDL-Like Logic of Knowledge Acquisition.	CSR	2007	DBLP DOI BibTeX RDF	knowledge acquisition, topological reasoning, propositional dynamic logic, logics of knowledge
35	Alexander S. Kulikov, Konstantin Kutzkov	New Bounds for MAX-SAT by Clause Learning.	CSR	2007	DBLP DOI BibTeX RDF
35	Yuri Gurevich	Proving Church's Thesis.	CSR	2007	DBLP DOI BibTeX RDF