Sciweavers

3724 search results - page 84 / 745
» Timed regular expressions
Sort
View
ICALP
2007
Springer
15 years 10 months ago
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
Noga Alon, Amin Coja-Oghlan, Hiêp Hàn...
CSMR
2006
IEEE
15 years 10 months ago
IntensiVE, a toolsuite for documenting and checking structural source-code regularities
As size and complexity of software systems increase, preserving the design and specification of their implementation structure gains importance in order to maintain the evolvabil...
Kim Mens, Andy Kellens
IPL
2007
105views more  IPL 2007»
15 years 3 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk
GLVLSI
2003
IEEE
134views VLSI» more  GLVLSI 2003»
15 years 9 months ago
Information storage capacity of crossbar switching networks
In this work we ask the fundamental question: How many bits of information can be stored in a crossbar switching network? The answer is trivial when the switches of the network ar...
Paul-Peter Sotiriadis
RTA
2000
Springer
15 years 7 months ago
Parallelism Constraints
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
Katrin Erk, Joachim Niehren